Converging Path Collision Avoidance

ABSTRACT

A method and apparatus for use in traversing a vehicle transportation network may include receiving, from a remote vehicle, via a wireless electronic communication link, a remote vehicle message, the remote vehicle message including remote vehicle information, determining a relative position code indicating geospatial location of the remote vehicle relative to the host vehicle based the remote vehicle information, determining a remote vehicle dynamic state code based on the remote vehicle information, determining a host vehicle dynamic state code; identifying a vehicle control action based on the relative position code, the remote vehicle dynamic state code, and the host vehicle dynamic state code, and traversing a portion of the vehicle transportation network in accordance with the vehicle control action, such that traversing the portion of the vehicle transportation network includes performing passing lane collision avoidance.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 15/078,842, filed Mar. 23, 2016; U.S. patent application Ser. No. 15/078,781, filed Mar. 23, 2016, now U.S. Pat. No. 9,783,145; U.S. patent application Ser. No. 15/078,729, filed Mar. 23, 2016; and U.S. patent application Ser. No. 15/078,504, filed Mar. 23, 2016, now U.S. Pat. No. 9,796,327, all of which are incorporated herein by reference in their entireties.

TECHNICAL FIELD

This disclosure relates to generating converging path information for use in traversing a vehicle transportation network.

BACKGROUND

A vehicle may traverse a portion of a vehicle transportation network. In the course of traversing a portion of a vehicle transportation network, a host vehicle may receive information representing one or more remote vehicles in the vehicle transportation network. Accordingly, a system, method, and apparatus for determining whether an expected path for a remote vehicle is convergent with an expected path for the host vehicle may be advantageous.

SUMMARY

Disclosed herein are aspects, features, elements, implementations, and embodiments of converging path codeword based passing lane collision avoidance.

An aspect of the disclosed embodiments is a vehicle comprising a processor configured to execute instructions stored on a non-transitory computer readable medium to traverse a vehicle transportation network by receiving, from a remote vehicle, via a wireless electronic communication link, a remote vehicle message, the remote vehicle message including remote vehicle information, determining a relative position code indicating geospatial location of the remote vehicle relative to the host vehicle based the remote vehicle information, determining a remote vehicle dynamic state code based on the remote vehicle information, determining a host vehicle dynamic state code, identifying a vehicle control action based on the relative position code, the remote vehicle dynamic state code, and the host vehicle dynamic state code, and traversing a portion of the vehicle transportation network in accordance with the vehicle control action, such that traversing the portion of the vehicle transportation network includes performing passing lane collision avoidance.

Variations in these and other aspects, features, elements, implementations, and embodiments of the methods, apparatus, procedures, and algorithms disclosed herein are described in further detail hereafter.

BRIEF DESCRIPTION OF THE DRAWINGS

The various aspects of the methods and apparatuses disclosed herein will become more apparent by referring to the examples provided in the following description and drawings.

FIG. 1 is a diagram of an example of a vehicle in which the aspects, features, and elements disclosed herein may be implemented.

FIG. 2 is a diagram of an example of a portion of a vehicle transportation and communication system in which the aspects, features, and elements disclosed herein may be implemented.

FIG. 3 is a diagram of geospatially locating remote vehicles based on automated inter-vehicle messages for use in generating converging path information in accordance with this disclosure.

FIG. 4 is a diagram of orientation sectors for generating converging path information in accordance with this disclosure.

FIG. 5 is a diagram of identifying inter-vehicle state information including a geodesic for a first orientation sector for use in generating converging path information in accordance with this disclosure.

FIG. 6 is a diagram of identifying inter-vehicle state information including convergence information for the first orientation sector for use in generating converging path information in accordance with this disclosure.

FIG. 7 is a diagram of identifying inter-vehicle state information including relative longitudinal position for the remote vehicle for a first orientation sector for use in generating converging path information in accordance with this disclosure.

FIG. 8 is a diagram of identifying inter-vehicle state information including relative lateral position information for the remote vehicle for a first orientation sector for use in generating converging path information in accordance with this disclosure.

FIG. 9 is a diagram of identifying inter-vehicle state information including a geodesic for a second orientation sector for use in generating converging path information in accordance with this disclosure.

FIG. 10 is a diagram of identifying inter-vehicle state information including convergence information for the second orientation sector for use in generating converging path information in accordance with this disclosure.

FIG. 11 is a diagram of identifying inter-vehicle state information including longitudinal position for the remote vehicle for a second orientation sector for use in generating converging path information in accordance with this disclosure.

FIG. 12 is a diagram of identifying inter-vehicle state information including relative lateral position information for the remote vehicle for a second orientation sector for use in generating converging path information in accordance with this disclosure.

FIG. 13 is a diagram of identifying inter-vehicle state information including a geodesic for a third orientation sector for use in generating converging path information in accordance with this disclosure.

FIG. 14 is a diagram of identifying inter-vehicle state information including convergence information for the third orientation sector for use in generating converging path information in accordance with this disclosure.

FIG. 15 is a diagram of identifying inter-vehicle state information including longitudinal position for the remote vehicle for a third orientation sector for use in generating converging path information in accordance with this disclosure.

FIG. 16 is a diagram of identifying inter-vehicle state information including relative lateral position for the remote vehicle for a third orientation sector for use in generating converging path information in accordance with this disclosure.

FIG. 17 is a diagram of identifying inter-vehicle state information including a geodesic for a fourth orientation sector for use in generating converging path information in accordance with this disclosure.

FIG. 18 is a diagram of identifying inter-vehicle state information including convergence information for the fourth orientation sector for use in generating converging path information in accordance with this disclosure.

FIG. 19 is a diagram of identifying inter-vehicle state information including longitudinal position for the remote vehicle for a fourth orientation sector for use in generating converging path information in accordance with this disclosure.

FIG. 20 is a diagram of identifying inter-vehicle state information including a relative lateral position of the remote vehicle for a fourth orientation sector for use in generating converging path information in accordance with this disclosure.

FIG. 21 is a diagram of identifying inter-vehicle state information including relative elevation information for use in generating converging path information in accordance with this disclosure.

FIG. 22 is a diagram of determining relative heading information for directionally aligned vehicles in accordance with this disclosure.

FIG. 23 is a diagram of determining relative heading information with divergent paths in accordance with this disclosure.

FIGS. 24 and 25 are diagrams of determining relative heading information wherein a difference between the remote vehicle heading angle and the reference direction is within a threshold in accordance with this disclosure.

FIG. 26 is a diagram of determining relative heading information for directionally opposed vehicles in accordance with this disclosure.

FIG. 27 is a diagram of determining relative heading information with divergent paths in accordance with this disclosure.

FIGS. 28 and 29 are diagrams of determining relative heading information wherein a difference between the remote vehicle heading angle and the reference direction is within a threshold in accordance with this disclosure.

FIG. 30 is a diagram of determining relative heading information for directionally crossing vehicles in accordance with this disclosure.

FIG. 31 is a diagram of traversing a vehicle transportation network including generating converging path information in accordance with this disclosure.

FIG. 32 is a diagram of generating convergence, or converging path, information in accordance with this disclosure.

FIG. 33 is a diagram of passing lane collision avoidance in accordance with this disclosure.

FIG. 34 is a logic flow diagram of the example of passing lane collision avoidance shown in FIG. 33, in accordance with this disclosure.

FIG. 35 is a diagram of blind spot collision avoidance in accordance with this disclosure.

FIG. 36 is a logic flow diagram of left blind spot collision avoidance in accordance with this disclosure.

FIG. 37 is a logic flow diagram of right blind spot collision avoidance in accordance with this disclosure.

FIG. 38 is a diagram of an example forward collision avoidance in accordance with this disclosure.

FIG. 39 is a logic flow diagram of the example of forward collision avoidance shown in FIG. 38 in accordance with this disclosure.

FIG. 40 is a diagram of rear-end collision avoidance in accordance with this disclosure.

FIG. 41 is a logic flow diagram of the example of rear-end collision avoidance shown in FIG. 40, in accordance with this disclosure.

DETAILED DESCRIPTION

A host vehicle may traverse a portion of a vehicle transportation network, wherein a path of the host vehicle may intersect with respective paths of remote vehicles. To avoid collision between the host vehicle and the remote vehicles, and to improve the efficiency of the traversal, the host vehicle may determine whether an expected path for a remote vehicle, such as a remote vehicle within a defined spatial distance from the host vehicle, is convergent with an expected path for the host vehicle.

In some embodiments, the host vehicle may determine whether an expected path for a remote vehicle is convergent with an expected path for the host vehicle based, at least in part, on information for the remote vehicle, such as location information, heading information, or kinetic state information. In some embodiments, determining whether an expected path for a remote vehicle is convergent with an expected path for a host vehicle may include generating a relative position code indicating whether the expected path for a remote vehicle is convergent with the expected path for the host vehicle.

In some embodiments, the host vehicle may identify a remote vehicle dynamic state code indicating a dynamic state of the remote vehicle, such as whether the remote vehicle is in motion, a steering direction for the remote vehicle, a transmission state of the remote vehicle, a turn signal state for the remote vehicle, or the like. In some embodiments, the host vehicle may identify a host vehicle dynamic state code indicating a dynamic state of the host vehicle, such as whether the host vehicle is in motion, a steering direction for the host vehicle, a transmission state of the host vehicle, a turn signal state for the host vehicle, or the like.

In some embodiments, based on the relative position code, the remote vehicle dynamic state code, the host vehicle dynamic state code, and a current acceleration rate for the host vehicle, the host vehicle may identify an expected passing lane collision condition, which may indicate an expected collision between the host vehicle and the remote vehicle approaching the host vehicle in an opposing lane to the left of a current lane of the host vehicle, associated with traversing a portion of the vehicle transportation network by changing lanes into the opposing lane to pass a vehicle, or other obstruction, in the current lane.

As used herein, the terminology “computer” or “computing device” includes any unit, or combination of units, capable of performing any method, or any portion or portions thereof, disclosed herein.

As used herein, the terminology “processor” indicates one or more processors, such as one or more special purpose processors, one or more digital signal processors, one or more microprocessors, one or more controllers, one or more microcontrollers, one or more application processors, one or more Application Specific Integrated Circuits, one or more Application Specific Standard Products; one or more Field Programmable Gate Arrays, any other type or combination of integrated circuits, one or more state machines, or any combination thereof.

As used herein, the terminology “memory” indicates any computer-usable or computer-readable medium or device that can tangibly contain, store, communicate, or transport any signal or information that may be used by or in connection with any processor. For example, a memory may be one or more read only memories (ROM), one or more random access memories (RAM), one or more registers, low power double data rate (LPDDR) memories, one or more cache memories, one or more semiconductor memory devices, one or more magnetic media, one or more optical media, one or more magneto-optical media, or any combination thereof.

As used herein, the terminology “instructions” may include directions or expressions for performing any method, or any portion or portions thereof, disclosed herein, and may be realized in hardware, software, or any combination thereof. For example, instructions may be implemented as information, such as a computer program, stored in memory that may be executed by a processor to perform any of the respective methods, algorithms, aspects, or combinations thereof, as described herein. In some embodiments, instructions, or a portion thereof, may be implemented as a special purpose processor, or circuitry, that may include specialized hardware for carrying out any of the methods, algorithms, aspects, or combinations thereof, as described herein. In some implementations, portions of the instructions may be distributed across multiple processors on a single device, on multiple devices, which may communicate directly or across a network such as a local area network, a wide area network, the Internet, or a combination thereof.

As used herein, the terminology “example”, “embodiment”, “implementation”, “aspect”, “feature”, or “element” indicates serving as an example, instance, or illustration. Unless expressly indicated, any example, embodiment, implementation, aspect, feature, or element is independent of each other example, embodiment, implementation, aspect, feature, or element and may be used in combination with any other example, embodiment, implementation, aspect, feature, or element.

As used herein, the terminology “determine” and “identify”, or any variations thereof, includes selecting, ascertaining, computing, looking up, receiving, determining, establishing, obtaining, or otherwise identifying or determining in any manner whatsoever using one or more of the devices shown and described herein.

As used herein, the terminology “or” is intended to mean an inclusive “or” rather than an exclusive “or”. That is, unless specified otherwise, or clear from context, “X includes A or B” is intended to indicate any of the natural inclusive permutations. That is, if X includes A; X includes B; or X includes both A and B, then “X includes A or B” is satisfied under any of the foregoing instances. In addition, the articles “a” and “an” as used in this application and the appended claims should generally be construed to mean “one or more” unless specified otherwise or clear from context to be directed to a singular form.

Further, for simplicity of explanation, although the figures and descriptions herein may include sequences or series of steps or stages, elements of the methods disclosed herein may occur in various orders or concurrently. Additionally, elements of the methods disclosed herein may occur with other elements not explicitly presented and described herein. Furthermore, not all elements of the methods described herein may be required to implement a method in accordance with this disclosure. Although aspects, features, and elements are described herein in particular combinations, each aspect, feature, or element may be used independently or in various combinations with or without other aspects, features, and elements.

FIG. 1 is a diagram of an example of a vehicle in which the aspects, features, and elements disclosed herein may be implemented. In some embodiments, a vehicle 1000 may include a chassis 1100, a powertrain 1200, a controller 1300, wheels 1400, or any other element or combination of elements of a vehicle. Although the vehicle 1000 is shown as including four wheels 1400 for simplicity, any other propulsion device or devices, such as a propeller or tread, may be used. In FIG. 1, the lines interconnecting elements, such as the powertrain 1200, the controller 1300, and the wheels 1400, indicate that information, such as data or control signals, power, such as electrical power or torque, or both information and power, may be communicated between the respective elements. For example, the controller 1300 may receive power from the powertrain 1200 and may communicate with the powertrain 1200, the wheels 1400, or both, to control the vehicle 1000, which may include accelerating, decelerating, steering, or otherwise controlling the vehicle 1000.

The powertrain 1200 may include a power source 1210, a transmission 1220, a steering unit 1230, an actuator 1240, or any other element or combination of elements of a powertrain, such as a suspension, a drive shaft, axles, or an exhaust system. Although shown separately, the wheels 1400 may be included in the powertrain 1200.

The power source 1210 may include an engine, a battery, or a combination thereof. The power source 1210 may be any device or combination of devices operative to provide energy, such as electrical energy, thermal energy, or kinetic energy. For example, the power source 1210 may include an engine, such as an internal combustion engine, an electric motor, or a combination of an internal combustion engine and an electric motor, and may be operative to provide kinetic energy as a motive force to one or more of the wheels 1400. In some embodiments, the power source 1210 may include a potential energy unit, such as one or more dry cell batteries, such as nickel-cadmium (NiCd), nickel-zinc (NiZn), nickel metal hydride (NiMH), lithium-ion (Li-ion); solar cells; fuel cells; or any other device capable of providing energy.

The transmission 1220 may receive energy, such as kinetic energy, from the power source 1210, and may transmit the energy to the wheels 1400 to provide a motive force. The transmission 1220 may be controlled by the controller 1300 the actuator 1240 or both. The steering unit 1230 may be controlled by the controller 1300 the actuator 1240 or both and may control the wheels 1400 to steer the vehicle. The vehicle actuator 1240 may receive signals from the controller 1300 and may actuate or control the power source 1210, the transmission 1220, the steering unit 1230, or any combination thereof to operate the vehicle 1000.

In some embodiments, the controller 1300 may include a location unit 1310, an electronic communication unit 1320, a processor 1330, a memory 1340, a user interface 1350, a sensor 1360, an electronic communication interface 1370, or any combination thereof. Although shown as a single unit, any one or more elements of the controller 1300 may be integrated into any number of separate physical units. For example, the user interface 1350 and processor 1330 may be integrated in a first physical unit and the memory 1340 may be integrated in a second physical unit. Although not shown in FIG. 1, the controller 1300 may include a power source, such as a battery. Although shown as separate elements, the location unit 1310, the electronic communication unit 1320, the processor 1330, the memory 1340, the user interface 1350, the sensor 1360, the electronic communication interface 1370, or any combination thereof may be integrated in one or more electronic units, circuits, or chips.

In some embodiments, the processor 1330 may include any device or combination of devices capable of manipulating or processing a signal or other information now-existing or hereafter developed, including optical processors, quantum processors, molecular processors, or a combination thereof. For example, the processor 1330 may include one or more special purpose processors, one or more digital signal processors, one or more microprocessors, one or more controllers, one or more microcontrollers, one or more integrated circuits, one or more an Application Specific Integrated Circuits, one or more Field Programmable Gate Array, one or more programmable logic arrays, one or more programmable logic controllers, one or more state machines, or any combination thereof. The processor 1330 may be operatively coupled with the location unit 1310, the memory 1340, the electronic communication interface 1370, the electronic communication unit 1320, the user interface 1350, the sensor 1360, the powertrain 1200, or any combination thereof. For example, the processor may be operatively coupled with the memory 1340 via a communication bus 1380.

The memory 1340 may include any tangible non-transitory computer-usable or computer-readable medium, capable of, for example, containing, storing, communicating, or transporting machine readable instructions, or any information associated therewith, for use by or in connection with the processor 1330. The memory 1340 may be, for example, one or more solid state drives, one or more memory cards, one or more removable media, one or more read only memories, one or more random access memories, one or more disks, including a hard disk, a floppy disk, an optical disk, a magnetic or optical card, or any type of non-transitory media suitable for storing electronic information, or any combination thereof.

The communication interface 1370 may be a wireless antenna, as shown, a wired communication port, an optical communication port, or any other wired or wireless unit capable of interfacing with a wired or wireless electronic communication medium 1500. Although FIG. 1 shows the communication interface 1370 communicating via a single communication link, a communication interface may be configured to communicate via multiple communication links. Although FIG. 1 shows a single communication interface 1370, a vehicle may include any number of communication interfaces.

The communication unit 1320 may be configured to transmit or receive signals via a wired or wireless medium 1500, such as via the communication interface 1370. Although not explicitly shown in FIG. 1, the communication unit 1320 may be configured to transmit, receive, or both via any wired or wireless communication medium, such as radio frequency (RF), ultra violet (UV), visible light, fiber optic, wire line, or a combination thereof. Although FIG. 1 shows a single communication unit 1320 and a single communication interface 1370, any number of communication units and any number of communication interfaces may be used. In some embodiments, the communication unit 1320 may include a dedicated short range communications (DSRC) unit, an on-board unit (OBU), or a combination thereof.

The location unit 1310 may determine geolocation information, such as longitude, latitude, elevation, direction of travel, or speed, of the vehicle 1000. For example, the location unit may include a global positioning system (GPS) unit, such as a Wide Area Augmentation System (WAAS) enabled National Marine-Electronics Association (NMEA) unit, a radio triangulation unit, or a combination thereof. The location unit 1310 can be used to obtain information that represents, for example, a current heading of the vehicle 1000, a current position of the vehicle 1000 in two or three dimensions, a current angular orientation of the vehicle 1000, or a combination thereof.

The user interface 1350 may include any unit capable of interfacing with a person, such as a virtual or physical keypad, a touchpad, a display, a touch display, a heads-up display, a virtual display, an augmented reality display, a haptic display, a feature tracking device, such as an eye-tracking device, a speaker, a microphone, a video camera, a sensor, a printer, or any combination thereof. The user interface 1350 may be operatively coupled with the processor 1330, as shown, or with any other element of the controller 1300. Although shown as a single unit, the user interface 1350 may include one or more physical units. For example, the user interface 1350 may include an audio interface for performing audio communication with a person, and a touch display for performing visual and touch based communication with the person. In some embodiments, the user interface 1350 may include multiple displays, such as multiple physically separate units, multiple defined portions within a single physical unit, or a combination thereof.

The sensor 1360 may include one or more sensors, such as an array of sensors, which may be operable to provide information that may be used to control the vehicle. The sensors 1360 may provide information regarding current operating characteristics of the vehicle. The sensors 1360 can include, for example, a speed sensor, acceleration sensors, a steering angle sensor, traction-related sensors, braking-related sensors, steering wheel position sensors, eye tracking sensors, seating position sensors, or any sensor, or combination of sensors, that is operable to report information regarding some aspect of the current dynamic situation of the vehicle 1000.

In some embodiments, the sensors 1360 may include sensors that are operable to obtain information regarding the physical environment surrounding the vehicle 1000. For example, one or more sensors may detect road geometry and obstacles, such as fixed obstacles, vehicles, and pedestrians. In some embodiments, the sensors 1360 can be or include one or more video cameras, laser-sensing systems, infrared-sensing systems, acoustic-sensing systems, or any other suitable type of on-vehicle environmental sensing device, or combination of devices, now known or later developed. In some embodiments, the sensors 1360 and the location unit 1310 may be combined.

Although not shown separately, in some embodiments, the vehicle 1000 may include a trajectory controller. For example, the controller 1300 may include the trajectory controller. The trajectory controller may be operable to obtain information describing a current state of the vehicle 1000 and a route planned for the vehicle 1000, and, based on this information, to determine and optimize a trajectory for the vehicle 1000. In some embodiments, the trajectory controller may output signals operable to control the vehicle 1000 such that the vehicle 1000 follows the trajectory that is determined by the trajectory controller. For example, the output of the trajectory controller can be an optimized trajectory that may be supplied to the powertrain 1200, the wheels 1400, or both. In some embodiments, the optimized trajectory can be control inputs such as a set of steering angles, with each steering angle corresponding to a point in time or a position. In some embodiments, the optimized trajectory can be one or more paths, lines, curves, or a combination thereof.

One or more of the wheels 1400 may be a steered wheel, which may be pivoted to a steering angle under control of the steering unit 1230, a propelled wheel, which may be torqued to propel the vehicle 1000 under control of the transmission 1220, or a steered and propelled wheel that may steer and propel the vehicle 1000.

Although not shown in FIG. 1, a vehicle may include units, or elements not shown in FIG. 1, such as an enclosure, a Bluetooth® module, a frequency modulated (FM) radio unit, a Near Field Communication (NFC) module, a liquid crystal display (LCD) display unit, an organic light-emitting diode (OLED) display unit, a speaker, or any combination thereof.

FIG. 2 is a diagram of an example of a portion of a vehicle transportation and communication system in which the aspects, features, and elements disclosed herein may be implemented. The vehicle transportation and communication system 2000 may include one or more vehicles 2100/2110, such as the vehicle 1000 shown in FIG. 1, which may travel via one or more portions of one or more vehicle transportation networks 2200, and may communicate via one or more electronic communication networks 2300. Although not explicitly shown in FIG. 2, a vehicle may traverse an area that is not expressly or completely included in a vehicle transportation network, such as an off-road area.

In some embodiments, the electronic communication network 2300 may be, for example, a multiple access system and may provide for communication, such as voice communication, data communication, video communication, messaging communication, or a combination thereof, between the vehicle 2100/2110 and one or more communication devices 2400. For example, a vehicle 2100/2110 may receive information, such as information representing the vehicle transportation network 2200, from a communication device 2400 via the network 2300.

In some embodiments, a vehicle 2100/2110 may communicate via a wired communication link (not shown), a wireless communication link 2310/2320/2370, or a combination of any number of wired or wireless communication links. For example, as shown, a vehicle 2100/2110 may communicate via a terrestrial wireless communication link 2310, via a non-terrestrial wireless communication link 2320, or via a combination thereof. In some implementations, a terrestrial wireless communication link 2310 may include an Ethernet link, a serial link, a Bluetooth link, an infrared (IR) link, an ultraviolet (UV) link, or any link capable of providing for electronic communication.

In some embodiments, a vehicle 2100/2110 may communicate with another vehicle 2100/2110. For example, a host, or subject, vehicle (HV) 2100 may receive one or more automated inter-vehicle messages, such as a basic safety message (BSM), from a remote, or target, vehicle (RV) 2110, via a direct communication link 2370, or via a network 2300. For example, the remote vehicle 2110 may broadcast the message to host vehicles within a defined broadcast range, such as 300 meters. In some embodiments, the host vehicle 2100 may receive a message via a third party, such as a signal repeater (not shown) or another remote vehicle (not shown). In some embodiments, a vehicle 2100/2110 may transmit one or more automated inter-vehicle messages periodically, based on, for example, a defined interval, such as 100 milliseconds.

In some embodiments, the host vehicle may receive remote vehicle information for remote vehicles within an adjustable range. For example, a host vehicle traversing a portion of a vehicle transportation network in an urban area may adjust the range to receive remote vehicle information for remote vehicles within an urban range, such as 300 meters, and a host vehicle traversing a portion of a vehicle transportation network in a rural area may adjust the range to receive remote vehicle information for remote vehicles within a rural range, such as 500 meters, or more. In some embodiments, the host vehicle may adjust the range based on a vehicle operation, such as passing another vehicle using an oncoming traffic lane. For example, a host vehicle may traverse a portion of the vehicle transportation network using a range of 300 meters, the host vehicle may begin pass another vehicle using an oncoming traffic lane, the host vehicle may increase the range to 500 meters, the host vehicle may complete passing the other vehicle, and the host vehicle may resume traversing the vehicle transportation network using the 300-meter range.

Automated inter-vehicle messages may include vehicle identification information, geospatial state information, such as longitude, latitude, or elevation information, geospatial location accuracy information, kinematic state information, such as vehicle acceleration information, yaw rate information, speed information, vehicle heading information, braking system status information, throttle information, steering wheel angle information, or vehicle routing information, or vehicle operating state information, such as vehicle size information, headlight state information, turn signal information, wiper status information, transmission information, or any other information, or combination of information, relevant to the transmitting vehicle state. For example, transmission state information may indicate whether the transmission of the transmitting vehicle is in a neutral state, a parked state, a forward state, or a reverse state.

In some embodiments, the vehicle 2100 may communicate with the communications network 2300 via an access point 2330. An access point 2330, which may include a computing device, may be configured to communicate with a vehicle 2100, with a communication network 2300, with one or more communication devices 2400, or with a combination thereof via wired or wireless communication links 2310/2340. For example, an access point 2330 may be a base station, a base transceiver station (BTS), a Node-B, an enhanced Node-B (eNode-B), a Home Node-B (HNode-B), a wireless router, a wired router, a hub, a relay, a switch, or any similar wired or wireless device. Although shown as a single unit, an access point may include any number of interconnected elements.

In some embodiments, the vehicle 2100 may communicate with the communications network 2300 via a satellite 2350, or other non-terrestrial communication device. A satellite 2350, which may include a computing device, may be configured to communicate with a vehicle 2100, with a communication network 2300, with one or more communication devices 2400, or with a combination thereof via one or more communication links 2320/2360. Although shown as a single unit, a satellite may include any number of interconnected elements.

An electronic communication network 2300 may be any type of network configured to provide for voice, data, or any other type of electronic communication. For example, the electronic communication network 2300 may include a local area network (LAN), a wide area network (WAN), a virtual private network (VPN), a mobile or cellular telephone network, the Internet, or any other electronic communication system. The electronic communication network 2300 may use a communication protocol, such as the transmission control protocol (TCP), the user datagram protocol (UDP), the internet protocol (IP), the real-time transport protocol (RTP) the Hyper Text Transport Protocol (HTTP), or a combination thereof. Although shown as a single unit, an electronic communication network may include any number of interconnected elements.

In some embodiments, a vehicle 2100 may identify a portion or condition of the vehicle transportation network 2200. For example, the vehicle may include one or more on-vehicle sensors 2105, such as sensor 1360 shown in FIG. 1, which may include a speed sensor, a wheel speed sensor, a camera, a gyroscope, an optical sensor, a laser sensor, a radar sensor, a sonic sensor, or any other sensor or device or combination thereof capable of determining or identifying a portion or condition of the vehicle transportation network 2200.

In some embodiments, a vehicle 2100 may traverse a portion or portions of one or more vehicle transportation networks 2200 using information communicated via the network 2300, such as information representing the vehicle transportation network 2200, information identified by one or more on-vehicle sensors 2105, or a combination thereof.

Although, for simplicity, FIG. 2 shows one vehicle 2100, one vehicle transportation network 2200, one electronic communication network 2300, and one communication device 2400, any number of vehicles, networks, or computing devices may be used. In some embodiments, the vehicle transportation and communication system 2000 may include devices, units, or elements not shown in FIG. 2. Although the vehicle 2100 is shown as a single unit, a vehicle may include any number of interconnected elements.

Although the vehicle 2100 is shown communicating with the communication device 2400 via the network 2300, the vehicle 2100 may communicate with the communication device 2400 via any number of direct or indirect communication links. For example, the vehicle 2100 may communicate with the communication device 2400 via a direct communication link, such as a Bluetooth communication link.

FIGS. 3-30 show examples of diagrams representing vehicles operating in one or more portions of one or more vehicle transportation networks. For simplicity and clarity, a host vehicle is shown with stippling and remote vehicles, if shown, are shown in white. For simplicity and clarity, the diagrams shown in FIGS. 3-20 and 22-30 are oriented with north at the top and east at the right side. In some embodiments, a defined geospatial range is shown as approximately 300 meters; however, other ranges may be used.

FIG. 3 is a diagram of geospatially locating remote vehicles based on automated inter-vehicle messages for use in generating converging path information in accordance with this disclosure. Geospatially locating remote vehicles based on automated inter-vehicle messages may be implemented in a vehicle, such as the vehicle 1000 shown in FIG. 1 or the vehicles 2100/2110 shown in FIG. 2. In some embodiments, one or more of the vehicles shown in FIG. 3, including the remote vehicles, the host vehicle, or both, may be stationary or may be in motion.

In some embodiments, a host vehicle 3000 may traverse a portion of a vehicle transportation network (not expressly shown), may receive automated inter-vehicle communications from one or more remote vehicles 3100/3200 within a defined geospatial range 3300, and may transmit automated inter-vehicle communications to one or more remote vehicles 3100/3200 within the defined geospatial range 3300. For simplicity and clarity, an automated inter-vehicle communication received by a host vehicle from a remote vehicle may be referred to herein as a remote vehicle message. For example, the host vehicle 3000 may receive the remote vehicle messages via a wireless electronic communication link, such as the wireless electronic communication link 2370 shown in FIG. 2.

In some embodiments, the automated inter-vehicle messages may indicate information such as geospatial location information and heading information. In some embodiments, the host vehicle 3000 may transmit one or more automated inter-vehicle messages including host vehicle information, such as host vehicle heading information. For example, as shown in FIG. 3, the host vehicle heading information may indicate that the host vehicle 3000 is heading straight ahead. In some embodiments, a remote vehicle 3100 may transmit one or more automated inter-vehicle messages including remote vehicle information, such as remote vehicle heading information. For example, the remote vehicle heading information may indicate that the remote vehicle 3100 is heading straight west. In another example, a remote vehicle 3200 may transmit one or more automated inter-vehicle messages including remote vehicle information that includes remote vehicle heading information, which may indicate that the remote vehicle 3100 is heading south.

In some embodiments, the host vehicle 3000 may identify a host vehicle expected path for the host vehicle 3010 based on host vehicle information, such as host vehicle geospatial state information and host vehicle kinematic state information. In some embodiments, the host vehicle 3000 may identify a remote vehicle expected path for a remote vehicle based on the automated inter-vehicle messages, which may include remote vehicle information, such as remote vehicle geospatial state information and remote vehicle kinematic state information. For example, the remote vehicle messages transmitted by the remote vehicle 3100 in the upper right of FIG. 3 may indicate that the remote vehicle 3100 is heading west and the host vehicle 3000 may identify the remote vehicle expected path 3110 for the remote vehicle 3100. In another example, the remote vehicle messages transmitted by the remote vehicle 3200 in the upper left of FIG. 3 may indicate that the remote vehicle 3200 is heading south, and may include navigation information, such as turn signal information indicating a left turn, and the host vehicle 3000 may identify the remote vehicle expected path 3210 for the remote vehicle 3200.

For simplicity and clarity, the heading and expected path of the host vehicle 3000 are shown as a solid directional line and the expected paths of respective remote vehicles are shown as directional broken lines. Expected paths are omitted from FIG. 3 for some vehicles for simplicity and clarity.

FIG. 4 is a diagram showing orientation sectors for generating converging path information in accordance with this disclosure. In some embodiments, generating converging path information may include determining an orientation sector (Q_(n)), which may indicate a quantized geospatial location, position, or direction, of a remote vehicle, relative to the host vehicle, in the geospatial domain. In some embodiments, locations relative to the host vehicle location may be quantized into a defined number, quantity, count, or cardinality, of orientation sectors (Q). For example, the defined set of orientation sectors (Q) may include four orientation sectors, or quadrants, which may include ninety degrees, or π/2 radians, each. However, any number, size, and direction of orientation sectors may be used. Although the host vehicle is shown in FIG. 4 as heading north, the orientation sector may be identified relative to the host vehicle geospatial location independently of the heading, path, or route of the host vehicle.

In some embodiments, the defined set of orientation sectors may be identified in the geospatial domain relative to the host vehicle and a reference direction, such as north. For example, relative to the host vehicle, the reference direction, north, may correspond with zero degrees or radians (0°, 360°, 2π), east may correspond with ninety degrees (90°) or π/2 radians, south may correspond with 180 degrees (180°) or π radians, and west may correspond with 270 degrees (270°) or 3π/2 radians.

As shown in FIG. 4, in some embodiments, the orientation sectors (Q) may include a first orientation sector Q₁ to the northeast of the host vehicle, which may include locations from north (0, 0°, 360°, 2π) to east (90° or π/2), which may be expressed as 0<=Q₁<π/2. The orientation sectors (Q) may include a second orientation sector Q₂ to the southeast of the host vehicle, which may include locations from east (90° or π/2) to south (180° or π), which may be expressed as π/2<=Q₂<π. The orientation sectors (Q) may include a third orientation sector Q₃ to the southwest of the host vehicle, which may include locations from south (180° or π) to west (270° or 3π/2), which may be expressed as π<=Q₃<3π/2. The orientation sectors (Q) may include a fourth orientation sector Q₄ to the northwest of the host vehicle, which may include locations from west (270° or 3π/2) to north (0°, 360°, 2π, or 0), which may be expressed as 3π/2<=Q₄<2π.

In some embodiments, generating converging path information may include identifying inter-vehicle state information, such as information describing the geospatial position and expected path of respective remote vehicles relative to the host vehicle location and expected path. Examples of generating converging path information using the first orientation sector Q₁ are shown in FIGS. 5-8. Examples of generating converging path information using the second orientation sector Q₂ are shown in FIGS. 9-12. Examples of generating converging path information using the third orientation sector Q₃ are shown in FIGS. 13-16. Examples of generating converging path information using the fourth orientation sector Q₄ are shown in FIGS. 17-20.

In some embodiments, a remote vehicle (RV) may be identified in the first orientation sector Q₁, to the northeast of the host vehicle (HV), as shown in FIGS. 5-8. For example, the latitude of the remote vehicle may be greater than the latitude for the host vehicle, the longitude for remote vehicle may be greater than the longitude for the host vehicle, and the remote vehicle may be identified as being in the first orientation sector Q₁, which may be expressed as the following:

$\begin{matrix} {Q_{1} = {{\frac{1}{4}\left\lbrack {\frac{\varphi_{RV} - \varphi_{HV} - \sigma}{{{\varphi_{RV} - \varphi_{HV}}} + \sigma} + 1} \right\rbrack} \times {\left\lbrack {\frac{\theta_{RV} - \theta_{HV} - \sigma}{{{\theta_{RV} - \theta_{HV}}} + \sigma} + 1} \right\rbrack.}}} & \left\lbrack {{Equation}\mspace{14mu} 1} \right\rbrack \end{matrix}$

For example, the latitude of the remote vehicle may be greater than the latitude for the host vehicle, the longitude for remote vehicle may be greater than the longitude for the host vehicle, Equation 1 may evaluate to one, and the remote vehicle may be identified as being in the first orientation sector Q₁. In some embodiments, the remote vehicle may be in an orientation sector other than the first orientation sector Q₁ and Equation 1 may evaluate to zero.

FIG. 5 is a diagram of identifying inter-vehicle state information including a geodesic for a first orientation sector for use in generating converging path information in accordance with this disclosure. Identifying inter-vehicle state information may be implemented in a vehicle, such as the vehicle 1000 shown in FIG. 1 or the vehicles 2100/2110 shown in FIG. 2.

In some embodiments, as shown in FIG. 5, generating converging path information may include determining a convergence angle β₁ for a geodesic between the host vehicle (HV) and a respective remote vehicle (RV). A geodesic may indicate a geospatially direct line between a host vehicle and a respective remote vehicle, and may be determined relative to the host vehicle in the geospatial domain. The geodesic may be the shortest straight navigable or unnavigable line between the host vehicle and the remote vehicle respective of the curvature of the earth. In FIGS. 5-20 the geodesic is shown as a solid line intersecting with the host vehicle and the remote vehicle. Although the geodesic is shown as extending beyond the vehicles for clarity, the length of the geodesic may correspond with a geospatially direct line distance between the host vehicle and the remote vehicle. In some embodiments, generating converging path information may include determining a convergence angle β₁ for the geodesic. The convergence angle β₁ may indicate an angle between the geodesic and a reference direction relative to the host vehicle in the geospatial domain, such as north. For simplicity, in FIG. 5 the vehicles are shown heading north; however, the geodesic and convergence angle β₁ may be identified independently of vehicle heading. Although described herein with reference to a reference direction of north, other reference directions may be used. For example, in some embodiments, projected vehicle transportation network information may be generated using the direction of the geodesic as the reference direction and the convergence angle β₁ may be zero degrees. For simplicity and clarity, the angles described herein, such as convergence angle β₁, are identified clockwise.

In some embodiments, the geodesic may be determined based on host vehicle information, such as a geospatial location of the host vehicle, remote vehicle information, such as a geospatial location of the remote vehicle, or a combination thereof. For example, the host vehicle information may indicate a longitude (θ_(HV)) for the host vehicle, a latitude (φ_(HV)) for the host vehicle, or both, the remote vehicle information may indicate a longitude (θ_(R)) for the remote vehicle, a latitude (φ_(v)) for the remote vehicle, or both, σ may indicate a very small value, such as a value of a magnitude of 10⁻⁹, used to avoid dividing by zero, and determining the convergence angle β₁ may be expressed as the following:

$\begin{matrix} {\beta_{1} = {{\pi \left\lbrack {\frac{\theta_{HV} - \theta_{RV} - \sigma}{{{\theta_{HV} - \theta_{RV}}} + \sigma} + 1} \right\rbrack} - {{\cos^{- 1}\left( \frac{\left( {\varphi_{RV} - \varphi_{HV}} \right)}{\sqrt{{\left( {\theta_{RV} - \theta_{HV}} \right)^{2}\cos^{2}\varphi_{HV}} + \left( {\varphi_{RV} - \varphi_{HV}} \right)^{2}}} \right)}{\quad{\left\lbrack \frac{\theta_{HV} - \theta_{RV} - \sigma}{{{\theta_{HV} - \theta_{RV}}} + \sigma} \right\rbrack.}}}}} & \left\lbrack {{Equation}\mspace{14mu} 2} \right\rbrack \end{matrix}$

In some embodiments, a length of the geodesic, which may correspond to a geospatially direct line distance, or instantaneous distance, D between the host vehicle and the remote vehicle, may be determined based on the host vehicle information, the remote vehicle information, or a combination thereof. For example, f may indicate an earth flattening value, such as f=1/298.257223563, r_(e) may indicate a measure of the earth's equatorial radius, such as r_(e)=6,378,137 meters, and determining the distance D may be expressed as the following:

$\begin{matrix} {D = {\left( {1 - f} \right)r_{e}{\sqrt{\frac{{\left( {\theta_{RV} - \theta_{HV}} \right)^{2}\cos^{2}\varphi_{HV}} + \left( {\varphi_{RV} - \varphi_{HV}} \right)^{2}}{{\sin^{2}\varphi_{HV}} + {\left( {1 - f} \right)^{2}\cos^{2}\varphi_{HV}}}}.}}} & \left\lbrack {{Equation}\mspace{14mu} 3} \right\rbrack \end{matrix}$

In some embodiments, generating converging path information may include determining an orientation sector, as shown in FIG. 4, which may indicate a geospatial location of a remote vehicle relative to the host vehicle, which may correspond with the convergence angle β₁, which may indicate the location of the geodesic relative to the reference direction and the host vehicle.

In some embodiments, generating converging path information may include determining a host vehicle region for the host vehicle, as shown in FIG. 5. The host vehicle region may indicate a quantization of a host vehicle heading angle δ_(HV), which may indicate the host vehicle heading or expected path relative to the host vehicle and the geodesic in the geospatial domain. For example, relative to the orientation sector, directions from the host vehicle may be quantized into a defined cardinality of regions, such as six regions as shown.

For example, for the first orientation sector Q₁, the remote vehicle, and the geodesic, is located to the northeast of the host vehicle in the geospatial domain. A first host vehicle region may include host vehicle heading angles δ_(HV) from the reference direction, which may correspond with north, to the convergence angle β₁ of the geodesic, which may be expressed as 0<=δ_(HV)<β₁. A second host vehicle region may include host vehicle heading angles δ_(HV) from the convergence angle β₁ of the geodesic to ninety degrees, which may correspond with east, and which may be expressed as β₁<=δ_(HV)<π/2. A third host vehicle region may include host vehicle heading angles δ_(HV) from ninety degrees to 180 degrees, which may correspond with south, and which may be expressed as π/2<=δ_(HV)<π. A fourth host vehicle region may include host vehicle heading angles δ_(HV) from 180 degrees to the opposite of the convergence angle β₁+π of the geodesic, which may be expressed as π<=δ_(HV)<β₁+π. A fifth host vehicle region may include host vehicle heading angles δ_(HV) from the opposite, with respect to the vertical, of the convergence angle β₁+π of the geodesic, to 270 degrees, which may correspond with west, and which may be expressed as β₁+π<=δ_(RV)<3π/2. A sixth host vehicle region may include host vehicle heading angles δ_(HV) from 270 degrees to 360 degrees, which may correspond with the reference direction, north, and the sixth host vehicle region may be expressed as 3π/2<=δ_(HV)<2π.

In some embodiments, generating converging path information may include determining a remote vehicle region for the remote vehicle. The remote vehicle region may indicate a quantization of a remote vehicle heading angle δ_(RV), which may indicate the remote vehicle heading or expected path, relative to the remote vehicle and the geodesic in the geospatial domain, and which may be determined relative to the orientation sector. For example, relative to the orientation sector, directions from the remote vehicle may be quantized into a defined cardinality of regions, such as six regions as shown, which may correspond with the host vehicle regions.

For example, for the first orientation sector Q₁, a first remote vehicle region may include remote vehicle heading angles δ_(RV) from the reference direction, which may correspond with north, to the convergence angle β₁ of the geodesic, which may be expressed as 0<=δ_(RV)<β₁. A second remote vehicle region may include remote vehicle heading angles δ_(RV) from the convergence angle β₁ of the geodesic to ninety degrees, which may correspond with east, and which may be expressed as β₁<=δ_(RV)<π/2. A third remote vehicle region may include remote vehicle heading angles δ_(RV) from ninety degrees to 180 degrees, which may correspond with south, and which may be expressed as π/2<=δ_(RV)<π. A fourth remote vehicle region may include remote vehicle heading angles δ_(RV) from 180 degrees to the opposite of the convergence angle β₁+π of the geodesic, which may be expressed as π<=δ_(RV)<β₁+π. A fifth remote vehicle region may include remote vehicle heading angles δ_(RV) from the opposite of the convergence angle β₁+π of the geodesic, to 270 degrees, which may correspond with west, and which may be expressed as β₁+π<=δ_(RV)<3π/2. A sixth remote vehicle region may include remote vehicle heading angles δ_(RV) from 270 degrees to 360 degrees, which may correspond with the reference direction, north, and which may be expressed as 3π/2<=δ_(RV)<2π.

FIG. 6 is a diagram of identifying inter-vehicle state information including convergence information for the first orientation sector for use in generating converging path information in accordance with this disclosure. Identifying inter-vehicle state information may be implemented in a vehicle, such as the vehicle 1000 shown in FIG. 1 or the vehicles 2100/2110 shown in FIG. 2.

In some embodiments, for the first orientation sector Q₁, generating converging path information may include identifying a host vehicle expected path 6000 for the host vehicle (HV), identifying respective remote vehicle expected paths 6100 for one or more of the remote vehicles (RV), or identifying respective expected paths 6000/6100 for the host vehicle and for one or more of the remote vehicles. In some embodiments, the expected paths may be projected, such as in a straight line, from the respective heading information.

In some embodiments, generating converging path information may include determining whether the remote vehicle expected path 6100 and the host vehicle expected path 6000 are convergent, which may indicate that the host vehicle expected path 6000 and the respective remote vehicle expected path 6100 intersect.

In some embodiments, for the first orientation sector Q₁, determining whether the remote vehicle expected path 6100 and the host vehicle expected path 6000 are convergent may include examining defined convergence data, such as Table 1 below. In Table 1 a value of zero (0) indicates that the remote vehicle expected path 6100 and the host vehicle expected path are not convergent and do not cross, a value of one (1) indicates that the remote vehicle expected path 6100 and the host vehicle expected path 6000 are convergent and do cross. A value of η_(HV) indicates that the remote vehicle expected path 6100 and the host vehicle expected path 6000 are convergent and do cross if the host vehicle heading angle δ_(HV) is greater than the remote vehicle heading angle δ_(HV) and are not convergent and do not cross if the remote vehicle heading angle δ_(RV) is at least the host vehicle heading angle δ_(HV). A value of η_(RV) indicates that the remote vehicle expected path 6100 and the host vehicle expected path 6000 are convergent and do cross if the host vehicle heading angle δ_(HV) is less than the remote vehicle heading angle δ_(RV) and are not convergent and do not cross if the host vehicle heading angle δ_(HV) is at least the remote vehicle heading angle δ_(RV). The notation HU indicates that the host vehicle region is region n. For example, HV₁ indicates that the host vehicle region is the first region and HV₆ indicates that the host vehicle region is the sixth region. The notation RV_(n) indicates that the remote vehicle region is region n. For example, RV₁ indicates that the remote vehicle region is the first region and RV₆ indicates that the remote vehicle region is the sixth region.

TABLE 1 RV₁ RV₂ RV₃ RV₄ RV₅ RV₆ HV₁ η_(HV) 0 0 0 1 1 HV₂ 0 η_(RV) 1 1 0 0 HV₃ 0 0 η_(RV) 1 0 0 HV₄ 0 0 0 η_(RV) 0 0 HV₅ 0 0 0 0 η_(HV) 0 HV₆ 0 0 0 0 1 η_(HV)

In some embodiments, for the first orientation sector Q₁, determining η_(HV) may be expressed as the following:

$\begin{matrix} {\eta_{HV} = {{\frac{1}{2}\left\lbrack {\frac{\delta_{HV} - \delta_{RV} - \sigma}{{{\delta_{RV} - \delta_{HV}}} + \sigma} + 1} \right\rbrack}.}} & \left\lbrack {{Equation}\mspace{14mu} 4} \right\rbrack \end{matrix}$

In some embodiments, for the first orientation sector Q₁, determining η_(RV) may be expressed as the following:

$\begin{matrix} {\eta_{RV} = {{\frac{1}{2}\left\lbrack {\frac{\delta_{RV} - \delta_{HV} - \sigma}{{{\delta_{RV} - \delta_{HV}}} + \sigma} + 1} \right\rbrack}.}} & \left\lbrack {{Equation}\mspace{14mu} 5} \right\rbrack \end{matrix}$

In some embodiments, for the first orientation sector Q₁, a combination (F_(m,n)) of the host vehicle heading angle δ_(HV) and the remote vehicle heading angle δ_(RV) may be expressed as shown in Tables 2-4.

TABLE 2 F_(m, n) RV₁ RV₂ RV₃ RV₄ RV₅ RV₆ HV₁ H₁ × R₁ H₁ × R₂ H₁ × R₃ H₁ × R₄ H₁ × R₅ H₁ × R₆ HV₂ H₂ × R₁ H₂ × R₂ H₂ × R₃ H₂ × R₄ H₂ × R₅ H₂ × R₆ HV₃ H₃ × R₁ H₃ × R₂ H₃ × R₃ H₃ × R₄ H₃ × R₅ H₃ × R₆ HV₄ H₄ × R₁ H₄ × R₂ H₄ × R₃ H₄ × R₄ H₄ × R₅ H₄ × R₆ HV₅ H₅ × R₁ H₅ × R₂ H₅ × R₃ H₅ × R₄ H₅ × R₅ H₅ × R₆ HV₆ H₆ × R₁ H₆ × R₂ H₆ × R₃ H₆ × R₄ H₆ × R₅ H₆ × R₆

TABLE 3 H₁ ${\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - 0 - \sigma}{{{\delta_{HV} - 0}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{\beta_{1} - \delta_{HV} - \sigma}{{{\beta_{1} - \delta_{HV}}} + \sigma} + 1} \right\rbrack$ H₂ ${\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - \beta_{1} - \sigma}{{{\delta_{HV} - \beta_{1}}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{\frac{\pi}{2} - \delta_{HV} - \sigma}{{{\frac{\pi}{2} - \delta_{HV}}} + \sigma} + 1} \right\rbrack$ H₃ ${\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - \frac{\pi}{2} - \sigma}{{{\delta_{HV} - \frac{\pi}{2}}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{\pi - \delta_{HV} - \sigma}{{{\pi - \delta_{HV}}} + \sigma} + 1} \right\rbrack$ H₄ ${\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - \pi - \sigma}{{{\delta_{HV} - \pi}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{\beta_{1} + \pi - \delta_{HV} - \sigma}{{{\beta_{1} + \pi - \delta_{HV}}} + \sigma} + 1} \right\rbrack$ H₅ ${\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - \left( {\beta_{1} + \pi} \right) - \sigma}{{{\delta_{HV} - \left( {\beta_{1} + \pi} \right)}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{\frac{3\pi}{2} - \delta_{HV} - \sigma}{{{\frac{3\pi}{2} - \delta_{HV}}} + \sigma} + 1} \right\rbrack$ H₆ ${\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - \frac{3\pi}{2} - \sigma}{{{\delta_{HV} - \frac{3\pi}{2}}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{{2\pi} - \delta_{HV} - \sigma}{{{{2\pi} - \delta_{HV}}} + \sigma} + 1} \right\rbrack$

TABLE 4 R₁ ${\frac{1}{4}\left\lbrack {\frac{\delta_{RV} - 0 - \sigma}{{{\delta_{RV} - 0}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{\beta_{1} - \delta_{RV} - \sigma}{{{\beta_{1} - \delta_{RV}}} + \sigma} + 1} \right\rbrack$ R₂ ${\frac{1}{4}\left\lbrack {\frac{\delta_{RV} - \beta_{1} - \sigma}{{{\delta_{RV} - \beta_{1}}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{\frac{\pi}{2} - \delta_{RV} - \sigma}{{{\frac{\pi}{2} - \delta_{RV}}} + \sigma} + 1} \right\rbrack$ R₃ ${\frac{1}{4}\left\lbrack {\frac{\delta_{RV} - \frac{\pi}{2} - \sigma}{{{\delta_{RV} - \frac{\pi}{2}}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{\pi - \delta_{RV} - \sigma}{{{\pi - \delta_{RV}}} + \sigma} + 1} \right\rbrack$ R₄ ${\frac{1}{4}\left\lbrack {\frac{\delta_{RV} - \pi - \sigma}{{{\delta_{RV} - \pi}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{\beta_{1} + \pi - \delta_{RV} - \sigma}{{{\beta_{1} + \pi - \delta_{RV}}} + \sigma} + 1} \right\rbrack$ R₅ ${\frac{1}{4}\left\lbrack {\frac{\delta_{RV} - \left( {\beta_{1} + \pi} \right) - \sigma}{{{\delta_{RV} - \left( {\beta_{1} + \pi} \right)}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{\frac{3\pi}{2} - \delta_{RV} - \sigma}{{{\frac{3\pi}{2} - \delta_{RV}}} + \sigma} + 1} \right\rbrack$ R₆ ${\frac{1}{4}\left\lbrack {\frac{\delta_{RV} - \frac{3\pi}{2} - \sigma}{{{\delta_{RV} - \frac{3\pi}{2}}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{{2\pi} - \delta_{RV} - \sigma}{{{{2\pi} - \delta_{RV}}} + \sigma} + 1} \right\rbrack$

In some embodiments, for the first orientation sector Q₁, generating converging path information may include determining a host vehicle approach angle α_(HV) for the host vehicle based on the host vehicle region HV_(n), the remote vehicle region RV_(n), the host vehicle heading angle δ_(HV), and the convergence angle β₁, as expressed in Table 5.

TABLE 5 α_(HV) = RV₁ RV₂ RV₃ RV₄ RV₅ RV₆ HV₁ −(δ_(HV) − β₁)  −(δ_(HV) − β₁)  −(δ_(HV) − β₁)  −(δ_(HV) − β₁)  −(δ_(HV) − β₁)  −(δ_(HV) − β₁)  HV₂ δ_(HV) − β₁ δ_(HV) − β₁ δ_(HV) − β₁ δ_(HV) − β₁ δ_(HV) − β₁ δ_(HV) − β₁ HV₃ δ_(HV) − β₁ δ_(HV) − β₁ δ_(HV) − β₁ δ_(HV) − β₁ δ_(HV) − β₁ δ_(HV) − β₁ HV₄ δ_(HV) − β₁ δ_(HV) − β₁ δ_(HV) − β₁ δ_(HV) − β₁ δ_(HV) − β₁ δ_(HV) − β₁ HV₅ 2π − (δ_(HV) − β₁) 2π − (δ_(HV) − β₁) 2π − (δ_(HV) − β₁) 2π − (δ_(HV) − β₁) 2π − (δ_(HV) − β₁) 2π − (δ_(HV) − β₁) HV₆ 2π −(δ_(HV) − β₁) 2π − (δ_(HV) − β₁) 2π − (δ_(HV) − β₁) 2π − (δ_(HV) − β₁) 2π − (δ_(HV) − β₁) 2π − (δ_(HV) − β₁)

In some embodiments, for the first orientation sector Q₁, generating converging path information may include determining a remote vehicle approach angle α_(RV) for the remote vehicle based on the host vehicle region HV_(n), the remote vehicle region RV_(n), the remote vehicle heading angle δ_(RV), and the convergence angle β₁, as expressed in Table 6.

TABLE 6 α_(RV) = RV₁ RV₂ RV₃ RV₄ RV₅ RV₆ HV₁ δ_(RV) − 0 0 0 δ_(RV) − δ_(RV) − β₁ + π β₁ − π β₁ − π HV₂ 0 −(δ_(RV) − −(δ_(RV) − −(δ_(RV) − 0 0 β₁ − π) β₁ − π) β₁ − π) HV₃ 0 0 −(δ_(RV) − −(δ_(RV) − 0 0 β₁ − π) β₁ − π) HV₄ 0 0 0 −(δ_(RV) − 0 0 β₁ − π) HV₅ 0 0 0 0 δ_(RV) − 0 β₁ − π HV₆ 0 0 0 0 δ_(RV) − δ_(RV) − β₁ − π β₁ − π

In some embodiments, for the first orientation sector Q₁, generating converging path information may include determining an intersection angle α_(D) based on the host vehicle region HV_(n), the remote vehicle region RV_(n), the host vehicle heading angle δ_(HV), and the remote vehicle heading angle δ_(RV), as expressed in Table 7.

TABLE 7 α_(D) = RV₁ RV₂ RV₃ RV₄ RV₅ RV₆ HV₁ δ_(HV) − 0 0 0 2π − 2π − δ_(RV) δ_(HV) − δ_(HV) − δ_(RV) δ_(RV) HV₂ 0 −(δ_(HV) − −(δ_(HV) − −(δ_(HV) − 0 0 δ_(RV)) δ_(RV)) δ_(RV)) HV₃ 0 0 −(δ_(HV) − −(δ_(HV) − 0 0 δ_(RV)) δ_(RV)) HV₄ 0 0 0 −(δ_(HV) − 0 0 δ_(RV)) HV₅ 0 0 0 0 δ_(RV) − 0 β₁ − π HV₆ 0 0 0 0 δ_(HV) − δ_(HV) − δ_(RV) δ_(RV)

In FIG. 6, L_(HV) indicates a distance from the host vehicle to the projected point of convergence with the remote vehicle expected path 6100, and L_(RV) indicates a distance from the remote vehicle to the projected point of convergence with the host vehicle expected path 6000.

In some embodiments, generating converging path information may include determining relative position information, relative elevation information, relative heading information, or a combination thereof. In some embodiments, relative position information may be determined based on an orientation sector, such as an orientation sector identified as shown in FIG. 4, as shown in FIGS. 7-8, 11-12, 15-16, and 19-20. In some embodiments, relative elevation information may be generated as shown in FIG. 21. In some embodiments, relative heading information may be generated as shown in FIGS. 22-30.

In some embodiments, determining relative position information may include determining relative position information for a remote vehicle relative to the host vehicle, which may include a relative longitudinal position for the remote vehicle (XW), a relative lateral position for the remote vehicle (VU), or both. The relative longitudinal position may indicate a quantization of a remote vehicle longitudinal position relative to the host vehicle position in the geospatial domain, and may be determined relative to the orientation sector. The relative lateral position may indicate a quantization of a remote vehicle lateral position relative to the host vehicle position in the geospatial domain, and may be determined relative to the orientation sector.

In some embodiments, for the first orientation sector Q₁, determining the relative position information for the remote vehicle may include determining a relative longitudinal position for the remote vehicle (XW), as shown in FIG. 7, a relative lateral position for the remote vehicle (VU), as shown in FIG. 8, or both. For simplicity and clarity, in FIGS. 7 and 8, the host vehicle is shown as heading northeast and the remote vehicle heading is omitted.

FIG. 7 is a diagram of identifying inter-vehicle state information including relative longitudinal position for the remote vehicle (XW) for a first orientation sector Q₁ for use in generating converging path information in accordance with this disclosure. In some embodiments a relative longitudinal position of the remote vehicle (XW) may be identified based on host vehicle information, such as a geospatial location of the host vehicle, remote vehicle information, such as a geospatial location of the remote vehicle, or a combination thereof.

In some embodiments, as shown in FIG. 7, the relative longitudinal position for the remote vehicle may be identified as being ahead of the host vehicle (XW=00), a remote vehicle heading angle δ_(RV) may indicate a heading angle for the remote vehicle, which may correspond with expected path for the remote vehicle, a host vehicle heading angle δ_(HV) may indicate a heading angle for the host vehicle, which may correspond with expected path for the host vehicle, an angular offset threshold φ_(P) may define an angular range in which the remote vehicle may be determined to be adjacent to the host vehicle, and 0<=δ_(HV)<A₁ or A₂<=δ_(HV)<2π may indicate that the relative longitudinal position for the remote vehicle is ahead of the host vehicle, where A₁=β₁+π/2−φ_(P), A₂=β₁+π/2+φ_(P), A₃=β₁+3π/2−φ_(P), and A₄=β₁+3π/2+φ_(P).

For example, determining that the relative longitudinal position for the remote vehicle is ahead of the host vehicle may be expressed as the following:

$\begin{matrix} {P_{Q_{1}} = {{{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - 0 + \sigma}{{{\delta_{HV} - 0}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{A_{1} - \delta_{HV} - \sigma}{{{A_{1} - \delta_{HV}}} + \sigma} + 1} \right\rbrack} + {{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - A_{4} + \sigma}{{{\delta_{HV} - A_{4}}} + \sigma} + 1} \right\rbrack} \times {\left\lbrack {\frac{{2\pi} - \delta_{HV} - \sigma}{\left. {{2\pi} - \delta_{HV}} \middle| {+ \sigma} \right.} + 1} \right\rbrack.}}}} & \left\lbrack {{Equation}\mspace{14mu} 6} \right\rbrack \end{matrix}$

In some embodiments, as shown in FIG. 7, the relative longitudinal position for the remote vehicle may be identified as being adjacent to the host vehicle (XW=01), and A₁<=δ_(HV)<A₂ or A₃<=δ_(HV)<A₄ may indicate that the relative longitudinal position for the remote vehicle is adjacent to the host vehicle, where A₁=β₁+π/2−φ_(P), A₂=β₁+π/2+φ_(P), A₃=β₁+3π/2−φ_(P), and A₄=β₁+3π/2+φ_(P).

For example, determining that the relative longitudinal position for the remote vehicle is adjacent to the host vehicle may be expressed as the following:

$\begin{matrix} {A_{Q_{1}} = {{{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - A_{1} + \sigma}{{{\delta_{HV} - A_{1}}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{A_{2} - \delta_{HV} - \sigma}{{{A_{2} - \delta_{HV}}} + \sigma} + 1} \right\rbrack} + {{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - A_{3} + \sigma}{{{\delta_{HV} - A_{3}}} + \sigma} + 1} \right\rbrack} \times {\left\lbrack {\frac{A_{4} - \delta_{HV} - \sigma}{\left. {A_{4} - \delta_{HV}} \middle| {+ \sigma} \right.} + 1} \right\rbrack.}}}} & \left\lbrack {{Equation}\mspace{14mu} 7} \right\rbrack \end{matrix}$

In some embodiments, as shown in FIG. 7, the relative longitudinal position for the remote vehicle may be identified as being behind the host vehicle (XW=10), and A₂<=δ_(HV)<A₃ may indicate that the relative longitudinal position for the remote vehicle is behind the host vehicle, where A₂=β₁+π/2+φ_(P), and A₃=β₁+3π/2−φ_(P).

For example, determining that the relative longitudinal position for the remote vehicle is behind the host vehicle may be expressed as the following:

$\begin{matrix} {B_{Q_{1}} = {{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - A_{2} + \sigma}{{{\delta_{HV} - A_{2}}} + \sigma} + 1} \right\rbrack} \times {\left\lbrack {\frac{A_{3} - \delta_{HV} - \sigma}{{{A_{3} - \delta_{HV}}} + \sigma} + 1} \right\rbrack.}}} & \left\lbrack {{Equation}\mspace{14mu} 8} \right\rbrack \end{matrix}$

In some embodiments, for the first orientation sector Q₁, a relative lateral position for the remote vehicle (VU) may be identified based on host vehicle information, such as a geospatial location of the host vehicle, remote vehicle information, such as a geospatial location of the remote vehicle, or a combination thereof.

FIG. 8 is a diagram of identifying inter-vehicle state information including relative lateral position information for the remote vehicle (VU) for a first orientation sector Q₁ for use in generating converging path information in accordance with this disclosure. In some embodiments, the relative lateral position for the remote vehicle may be identified as being in-line with, or in the same lane as, the host vehicle (VU=00), a remote vehicle heading angle δ_(RV) may indicate a heading angle for the remote vehicle, which may correspond with expected path for the remote vehicle, a host vehicle heading angle δ_(HV) may indicate a heading angle for the host vehicle, which may correspond with an expected path for the host vehicle, an angular offset threshold φ_(I) may define an angular range in which the relative lateral position for the remote vehicle may be determined to be in-line with the host vehicle, and A₅<=δ_(HV)<A₆ or A₇<=δ_(HV)<A₈ may indicate that the remote vehicle is in-line with the host vehicle, where A₅=β₁−φ₂, A₆=β₁+φ_(I), A₇=β₁+π−φ_(I), and A₈=β₁+π+φ_(I).

For example, determining that the relative lateral position for the remote vehicle is in-line with the host vehicle may be expressed as the following:

$\begin{matrix} {I_{Q_{1}} = {{{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - A_{5} + \sigma}{{{\delta_{HV} - A_{5}}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{A_{6} - \delta_{HV} - \sigma}{{{A_{6} - \delta_{HV}}} + \sigma} + 1} \right\rbrack} + {{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - A_{7} + \sigma}{{{\delta_{HV} - A_{7}}} + \sigma} + 1} \right\rbrack} \times {\left\lbrack {\frac{A_{8} - \delta_{HV} - \sigma}{\left. {A_{8} - \delta_{HV}} \middle| {+ \sigma} \right.} + 1} \right\rbrack.}}}} & \left\lbrack {{Equation}\mspace{14mu} 9} \right\rbrack \end{matrix}$

In some embodiments, as shown in FIG. 8, the relative lateral position for the remote vehicle may be identified as being to the left of the host vehicle (VU=01), and A₆<=δ_(HV)<A₇ may indicate that the relative lateral position for the remote vehicle is to the left of the host vehicle, where A₅=β₁−φ_(I), A₆=β₁+φ_(I), A₇=β₁+π−φ_(I), and A₈=β₁+π+φ_(I).

For example, determining that the relative lateral position for the remote vehicle is to the left of the host vehicle may be expressed as the following:

$\begin{matrix} {L_{Q_{1}} = {{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - A_{6} + \sigma}{{{\delta_{HV} - A_{6}}} + \sigma} + 1} \right\rbrack} \times {\left\lbrack {\frac{A_{7} - \delta_{HV} - \sigma}{{{A_{7} - \delta_{HV}}} + \sigma} + 1} \right\rbrack.}}} & \left\lbrack {{Equation}\mspace{14mu} 10} \right\rbrack \end{matrix}$

In some embodiments, as shown in FIG. 8, the relative lateral position for the remote vehicle may be identified as being to the right of the host vehicle (VU=10), and 0<=δ_(HV)<A₅ or A₈<=δ_(HV)<2π may indicate that the relative lateral position for the remote vehicle is to the right of the host vehicle, where A₅=β₁−φ_(I), A₆=β₁+φ_(I), A₇=β₁+π−φ_(I), and A₈=β₁+π+φ_(I).

For example, determining that the relative lateral position for the remote vehicle is to the right of the host vehicle may be expressed as the following:

$\begin{matrix} {R_{Q_{1}} = {{{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - 0 + \sigma}{{{\delta_{HV} - 0}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{A_{5} - \delta_{HV} - \sigma}{{{A_{5} - \delta_{HV}}} + \sigma} + 1} \right\rbrack} + {{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - A_{8} + \sigma}{{{\delta_{HV} - A_{8}}} + \sigma} + 1} \right\rbrack} \times {\left\lbrack {\frac{{2\pi} - \delta_{HV} - \sigma}{\left. {{2\pi} - \delta_{HV}} \middle| {+ \sigma} \right.} + 1} \right\rbrack.}}}} & \left\lbrack {{Equation}\mspace{14mu} 11} \right\rbrack \end{matrix}$

In an example, for the first orientation sector Q₁, determining relative position information may be expressed as shown in the following table:

TABLE 8 Lateral Position Q₁ RV in lane (I_(Q) ₁ ) RV Left (L_(Q) ₁ ) RV Right (R_(Q) ₁ ) Longitudinal RV Ahead (P_(Q) ₁ ) Q₁ × P_(Q) ₁ × I_(Q) ₁ Q ₁ × P_(Q) ₁ × L_(Q) ₁ Q₁ × P_(Q) ₁ × R_(Q) ₁ Position RV Adjacent (A_(Q) ₁ ) Q₁ × A_(Q) ₁ × I_(Q) ₁ Q₁ × A_(Q) ₁ × L_(Q) ₁ Q ₁ × A_(Q) ₁ × R_(Q) ₁ RV Behind (B_(Q) ₁ ) Q ₁ × B_(Q) ₁ × I_(Q) ₁ Q ₁ × B_(Q) ₁ × L_(Q) ₁ Q ₁ × B_(Q) ₁ × R_(Q) ₁

In some embodiments, a remote vehicle (RV) may be identified in the second orientation sector Q₂, to the southeast of the host vehicle (HV), as shown in FIGS. 9-12. For example, the latitude of the remote vehicle may be less than the latitude for the host vehicle, the longitude for remote vehicle may be greater than the longitude for the host vehicle, and the remote vehicle may be identified as being in the second orientation sector Q₂, which may be expressed as the following:

$\begin{matrix} {Q_{2} = {{\frac{1}{4}\left\lbrack {\frac{\varphi_{HV} - \varphi_{RV} + \sigma}{{{\varphi_{HV} - \varphi_{RV}}} + \sigma} + 1} \right\rbrack} \times {\left\lbrack {\frac{\theta_{RV} - \theta_{HV} - \sigma}{{{\theta_{RV} - \theta_{HV}}} + \sigma} + 1} \right\rbrack.}}} & \left\lbrack {{Equation}\mspace{14mu} 12} \right\rbrack \end{matrix}$

For example, the latitude of the remote vehicle may be less than the latitude for the host vehicle, the longitude for remote vehicle may be greater than the longitude for the host vehicle, Equation 12 may evaluate to one, and the remote vehicle may be identified as being in the second orientation sector Q₂. In some embodiments, the remote vehicle may be in an orientation sector other than the second orientation sector Q₂ and Equation 12 may evaluate to zero.

FIG. 9 is a diagram of identifying inter-vehicle state information including a geodesic for a second orientation sector Q₂ for use in generating converging path information in accordance with this disclosure. Identifying inter-vehicle state information including the geodesic for the second orientation sector for use in generating converging path information may be similar to the identification shown in FIG. 5, except as described herein. In the second orientation sector Q₂ the remote vehicle, and the geodesic, is located to the southeast of the host vehicle in the geospatial domain.

In some embodiments, as shown in FIG. 9, for the second orientation sector Q₂, generating converging path information may include determining a host vehicle region for the host vehicle. A first host vehicle region may include host vehicle heading angles δ_(HV) from the reference direction, which may correspond with north, to ninety degrees, which may correspond with east, and which may be expressed as 0<=δ_(HV)<π/2. A second host vehicle region may include host vehicle heading angles δ_(HV) from ninety degrees to the convergence angle β₁ of the geodesic, and which may be expressed as π/2<=δ_(HV)<β₁. A third host vehicle region may include host vehicle heading angles δ_(HV) from the convergence angle β₁ of the geodesic to 180 degrees, which may correspond with south, and which may be expressed as β₁<=δ_(HV)<π. A fourth host vehicle region may include host vehicle heading angles δ_(HV) from 180 degrees to 270 degrees, which may correspond with west, and which may be expressed as β₁<=δ_(HV)<3π/2. A fifth host vehicle region may include host vehicle heading angles δ_(HV) from 270 degrees to a sum of the convergence angle β₁ of the geodesic and 180 degrees π, which may be expressed as 3π/2<=δ_(HV)<β₁+π. A sixth host vehicle region may include host vehicle heading angles δ_(HV) from the sum of the convergence angle β₁ of the geodesic and 180 degrees π to 360 degrees, which may correspond with the reference direction, north, and which may be expressed as β₁+π<=δ_(HV)<2π.

In some embodiments, as shown in FIG. 9, for the second orientation sector, generating converging path information may include determining a remote vehicle region for the remote vehicle. A first remote vehicle region may include remote vehicle heading angles δ_(RV) from the reference direction, which may correspond with north, to ninety degrees, which may correspond with east, and which may be expressed as 0<=δ_(RV)<π/2. A second remote vehicle region may include remote vehicle heading angles δ_(RV) from ninety degrees to the convergence angle β₁ of the geodesic, and which may be expressed as π/2<=δ_(RV)<β₁. A third remote vehicle region may include remote vehicle heading angles δ_(RV) from the convergence angle β₁ of the geodesic to 180 degrees, which may correspond with south, and which may be expressed as β₁<=δ_(RV)<π. A fourth remote vehicle region may include remote vehicle heading angles δ_(RV) from 180 degrees to 270 degrees, which may correspond with west, and which may be expressed as π<=δ_(RV)<3π/2. A fifth remote vehicle region may include remote vehicle heading angles δ_(RV) from 270 degrees to a sum of the convergence angle β₁ of the geodesic and 180 degrees π, which may be expressed as 3π/2<=δ_(RV)<β₁+π. A sixth remote vehicle region may include remote vehicle heading angles δ_(RV) from the sum of the convergence angle β₁ of the geodesic and 180 degrees π to 360 degrees, which may correspond with the reference direction, north, and which may be expressed as β₁+π<=δ_(RV)<2π.

FIG. 10 is a diagram of identifying inter-vehicle state information including convergence information for the second orientation sector for use in generating converging path information in accordance with this disclosure. Identifying inter-vehicle state information including a geodesic for the second orientation sector for use in generating converging path information may be similar to the identification shown in FIG. 6, except as described herein.

In some embodiments, for the second orientation sector Q₂, generating converging path information may include identifying a host vehicle expected path 10000 for the host vehicle (HV), identifying respective remote vehicle expected paths 10100 for one or more of the remote vehicles (RV), or identifying respective expected paths 10000/10100 for the host vehicle and for one or more of the remote vehicles. In some embodiments, the expected paths may be projected, such as in a straight line, from the respective heading information.

In some embodiments, generating converging path information may include determining whether the remote vehicle expected path 10100 and the host vehicle expected path 10000 are convergent, which may indicate that the host vehicle expected path 10000 and the respective remote vehicle expected path 10100 intersect.

In some embodiments, for the second orientation sector Q₂, determining whether the remote vehicle expected path 10100 and the host vehicle expected path 10000 are convergent may include examining defined convergence data, such as the defined convergence data shown in Table 9.

TABLE 9 RV₁ RV₂ RV₃ RV₄ RV₅ RV₆ HV₁ η_(HV) 0 0 0 0 1 HV₂ 1 η_(HV) 0 0 0 1 HV₃ 0 1 η_(RV) 1 1 0 HV₄ 0 1 1 η_(RV) 1 0 HV₅ 0 0 0 0 η_(RV) 0 HV₆ 0 0 0 0 0 η_(HV)

In some embodiments, for the second orientation sector, determining η_(HV) may be expressed as shown in Equation 37. In some embodiments, determining η_(RV) may be expressed as shown in Equation 38.

In some embodiments, for the second orientation sector Q₂, a combination (F_(m,n)) of the host vehicle heading angle δ_(HV) and the remote vehicle heading angle δ_(RV) may be expressed as shown in Tables 10-12.

TABLE 10 F_(m,n) RV₁ RV₂ RV₃ RV₄ RV₅ RV₆ HV₁ H₁ × R₁ H₁ × R₂ H₁ × R₃ H₁ × R₄ H₁ × R₅ H₁ × R₆ HV₂ H₂ × R₁ H₂ × R₂ H₂ × R₃ H₂ × R₄ H₂ × R₅ H₂ × R₆ HV₃ H₃ × R₁ H₃ × R₂ H₃ × R₃ H₃ × R₄ H₃ × R₅ H₃ × R₆ HV₄ H₄ × R₁ H₄ × R₂ H₄ × R₃ H₄ × R₄ H₄ × R₅ H₄ × R₆ HV₅ H₅ × R₁ H₅ × R₂ H₅ × R₃ H₅ × R₄ H₅ × R₅ H₅ × R₆ HV₆ H₆ × R₁ H₆ × R₂ H₆ × R₃ H₆ × R₄ H₆ × R₅ H₆ × R₆

TABLE 11 H₁ ${\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - 0 - \sigma}{{{\delta_{HV} - 0}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{\frac{\pi}{2} - \delta_{HV} - \sigma}{{{\frac{\pi}{2} - \delta_{HV}}} + \sigma} + 1} \right\rbrack$ H₂ ${\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - \frac{\pi}{2} - \sigma}{{{\delta_{HV} - \frac{\pi}{2}}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{\beta_{1} - \delta_{HV} - \sigma}{{{\beta_{1} - \delta_{HV}}} + \sigma} + 1} \right\rbrack$ H₃ ${\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - \beta_{1} - \sigma}{{{\delta_{HV} - \beta_{1}}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{\pi - \delta_{HV} - \sigma}{{{\pi - \delta_{HV}}} + \sigma} + 1} \right\rbrack$ H₄ ${\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - \pi - \sigma}{{{\delta_{HV} - \pi}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{\frac{3\pi}{2} - \delta_{HV} - \sigma}{{{\frac{3\pi}{2} - \delta_{HV}}} + \sigma} + 1} \right\rbrack$ H₅ ${\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - \frac{3\pi}{2} - \sigma}{{{\delta_{HV} - \frac{3\pi}{2}}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{\beta_{1} + \pi - \delta_{HV} - \sigma}{{{\beta_{1} + \pi - \delta_{HV}}} + \sigma} + 1} \right\rbrack$ H₆ ${\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - \left( {\beta_{1} + \pi} \right) - \sigma}{{{\delta_{HV} - \left( {\beta_{1} + \pi} \right)}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{{2\pi} - \delta_{HV} - \sigma}{{{{2\pi} - \delta_{HV}}} + \sigma} + 1} \right\rbrack$

TABLE 12 R₁ ${\frac{1}{4}\left\lbrack {\frac{\delta_{RV} - 0 - \sigma}{{{\delta_{RV} - 0}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{\frac{\pi}{2} - \delta_{RV} - \sigma}{{{\frac{\pi}{2} - \delta_{RV}}} + \sigma} + 1} \right\rbrack$ R₂ ${\frac{1}{4}\left\lbrack {\frac{\delta_{RV} - \frac{\pi}{2} - \sigma}{{{\delta_{RV} - \frac{\pi}{2}}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{\beta_{1} - \delta_{RV} - \sigma}{{{\beta_{1} - \delta_{RV}}} + \sigma} + 1} \right\rbrack$ R₃ ${\frac{1}{4}\left\lbrack {\frac{\delta_{RV} - \beta_{1} - \sigma}{{{\delta_{RV} - \beta_{1}}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{\pi - \delta_{RV} - \sigma}{{{\pi - \delta_{RV}}} + \sigma} + 1} \right\rbrack$ R₄ ${\frac{1}{4}\left\lbrack {\frac{\delta_{RV} - \pi - \sigma}{{{\delta_{RV} - \pi}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{\frac{3\pi}{2} - \delta_{RV} - \sigma}{{{\frac{3\pi}{2} - \delta_{RV}}} + \sigma} + 1} \right\rbrack$ R₅ ${\frac{1}{4}\left\lbrack {\frac{\delta_{RV} - \frac{3\pi}{2} - \sigma}{{{\delta_{RV} - \frac{3\pi}{2}}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{\left( {\beta_{1} + \pi} \right) - \delta_{RV} - \sigma}{{{\left( {\beta_{1} + \pi} \right) - \delta_{RV}}} + \sigma} + 1} \right\rbrack$ R₆ ${\frac{1}{4}\left\lbrack {\frac{\delta_{RV} - \left( {\beta_{1} + \pi} \right) - \sigma}{{{\delta_{RV} - \left( {\beta_{1} + \pi} \right)}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{{2\pi} - \delta_{RV} - \sigma}{{{{2\pi} - \delta_{RV}}} + \sigma} + 1} \right\rbrack$

In some embodiments, for the second orientation sector Q₂, generating converging path information may include determining a host vehicle approach angle α_(HV) for the host vehicle based on the host vehicle region HV_(n), the remote vehicle region RV_(n), the host vehicle heading angle δ_(HV), and the convergence angle β₁, as expressed in Table 13.

TABLE 13 α_(HV) = RV₁ RV₂ RV₃ RV₄ RV₅ RV₆ HV₁ −(δ_(HV) − β₁) −(δ_(HV) − β₁) −(δ_(HV) − β₁) −(δ_(HV) − β₁) −(δ_(HV) − β₁) −(δ_(HV) − β₁) HV₂ −(δ_(HV) − β₁) −(δ_(HV) − β₁) −(δ_(HV) − β₁) −(δ_(HV) − β₁) −(δ_(HV) − β₁) −(δ_(HV) − β₁) HV₃ δ_(HV) − β₁ δ_(HV) − β₁ δ_(HV) − β₁ δ_(HV) − β₁ δ_(HV) − β₁ δ_(HV) − β₁ HV₄ δ_(HV) − β₁ δ_(HV) − β₁ δ_(HV) − β₁ δ_(HV) − β₁ δ_(HV) − β₁ δ_(HV) − β₁ HV₅ δ_(HV) − β₁ δ_(HV) − β₁ δ_(HV) − β₁ δ_(HV) − β₁ δ_(HV) − β₁ δ_(HV) − β₁ HV₆ 2π − (δ_(HV) − β₁₎ 2π − (δ_(HV) − β₁) 2π − (δ_(HV) − β₁) 2π − (δ_(HV) − β₁) 2π − (δ_(HV) − β₁) 2π − (δ_(HV) − β₁)

In some embodiments, for the second orientation sector Q₂, generating converging path information may include determining a remote vehicle approach angle α_(RV) for the remote vehicle based on the host vehicle region HV_(n), the remote vehicle region RV_(n), the remote vehicle heading angle δ_(RV), and the convergence angle β₁, as expressed in Table 14.

TABLE 14 α_(RV) = RV₁ RV₂ RV₃ RV₄ RV₅ RV₆ HV₁ δ_(RV) − β₁ + π 0 0 0 0 δ_(RV) − β₁ − π HV₂ δ_(RV) − β₁ + π δ_(RV) − β₁ + π 0 0 0 δ_(RV) − β₁ − π HV₃ 0 0 −(δ_(RV) − β₁ − π) −(δ_(RV) − β₁ − π) −(δ_(RV) − β₁ − π) 0 HV₄ 0 0 0 −(δ_(RV) − β₁ − π) −(δ_(RV) − β₁ − π) 0 HV₅ 0 0 0 0 −(δ_(RV) − β₁ − π) 0 HV₆ 0 0 0 0 0 δ_(RV) − β₁ − π

In some embodiments, for the second orientation sector, generating converging path information may include determining an intersection angle α_(RV) based on the host vehicle region HV_(n), the remote vehicle region RV_(n), the host vehicle heading angle δ_(HV), and the remote vehicle heading angle δ_(RV), as expressed in Table 15.

TABLE 15 α_(D) = RV₁ RV₂ RV₃ RV₄ RV₅ RV₆ HV₁ δ_(HV) − δ_(RV) 0 0 0 0 δ_(HV) − δ_(RV) + 2π HV₂ δ_(HV) − δ_(RV) δ_(HV) − δ_(RV) 0 0 0 δ_(HV) − δ_(RV) + 2π HV₃ 0 0 −(δ_(HV) − δ_(RV)) −(δ_(HV) − δ_(RV)) −(δ_(HV) − δ_(RV)) 0 HV₄ 0 0 0 −(δ_(HV) − δ_(RV)) −(δ_(HV) − δ_(RV)) 0 HV₅ 0 0 0 0 −(δ_(HV) − δ_(RV)) 0 HV₆ 0 0 0 0 0 δ_(HV) − δ_(RV)

In FIG. 10, L_(HV) indicates a distance from the host vehicle to the projected point of convergence with the remote vehicle expected path 10100, and L_(RV) indicates a distance from the remote vehicle to the projected point of convergence with the host vehicle expected path 10000.

In some embodiments, for the second orientation sector Q₂, determining the relative position information for the remote vehicle may include determining a relative longitudinal position for the remote vehicle (XW), as shown in FIG. 11, a relative lateral position for the remote vehicle (VU), as shown in FIG. 12, or both. For simplicity and clarity, in FIGS. 11 and 12, the host vehicle is shown as heading southeast and the remote vehicle heading is omitted.

FIG. 11 is a diagram of identifying inter-vehicle state information including longitudinal position for the remote vehicle (XW) for a second orientation sector Q₂ for use in generating converging path information in accordance with this disclosure. Identifying inter-vehicle state information including the longitudinal position for the remote vehicle (XW) for the second orientation sector for use in generating converging path information may be similar to the identification shown in FIG. 7, except as described herein. In some embodiments a relative longitudinal position of the remote vehicle (XW) may be identified based on host vehicle information, such as a geospatial location of the host vehicle, remote vehicle information, such as a geospatial location of the remote vehicle, or a combination thereof.

In some embodiments, as shown in FIG. 11, the relative longitudinal position for the remote vehicle may be identified as being ahead of the host vehicle (XW=00), a remote vehicle heading angle δ_(RV) may indicate a heading angle for the remote vehicle, which may correspond with expected path for the remote vehicle, a host vehicle heading angle δ_(HV) may indicate a heading angle for the host vehicle, which may correspond with expected path for the host vehicle, an angular offset threshold φ_(P) may define an angular range in which the remote vehicle may be determined to be adjacent to the host vehicle, and A₁₀<=δ_(HV)<A₁ may indicate that the relative longitudinal position for the remote vehicle is ahead of the host vehicle, where A₁=β₁+π/2−φ_(P), A₂=β₁+π/2+φ_(P), A₉=β₁−π/2−φ_(P), and A₁₀=β₁−π/2+φ_(P).

For example, determining that the relative longitudinal position for the remote vehicle is ahead of the host vehicle may be expressed as the following:

$\begin{matrix} {P_{Q_{2}} = {{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - A_{10} + \sigma}{{{\delta_{HV} - A_{10}}} + \sigma} + 1} \right\rbrack} \times {\left\lbrack {\frac{A_{1} - \delta_{HV} - \sigma}{{{A_{1} - \delta_{HV}}} + \sigma} + 1} \right\rbrack.}}} & \left\lbrack {{Equation}\mspace{14mu} 13} \right\rbrack \end{matrix}$

In some embodiments, as shown in FIG. 11, the relative longitudinal position for the remote vehicle may be identified as being adjacent to the host vehicle (XW=01), and A₁<=δ_(HV)<A₂ or A₉<=δ_(HV)<A₁₀ may indicate that the relative longitudinal position for the remote vehicle is adjacent to the host vehicle, where A₁=β₁+π/2−φ_(P), A₂=β₁+π/2+φ_(P), A₉=β₁−π/2−φ_(P), and A₁₀=β₁−π/2+φ_(P).

For example, determining that the relative longitudinal position for the remote vehicle is adjacent to the host vehicle may be expressed as the following:

$\begin{matrix} {A_{Q_{2}} = {{{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - A_{1} + \sigma}{{{\delta_{HV} - A_{1}}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{A_{2} - \delta_{HV} - \sigma}{{{A_{2} - \delta_{HV}}} + \sigma} + 1} \right\rbrack} + {{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - A_{9} + \sigma}{{{\delta_{HV} - A_{9}}} + \sigma} + 1} \right\rbrack} \times {\left\lbrack {\frac{A_{10} - \delta_{HV} - \sigma}{{{A_{10} - \delta_{HV}}} + \sigma} + 1} \right\rbrack.}}}} & \left\lbrack {{Equation}\mspace{14mu} 14} \right\rbrack \end{matrix}$

In some embodiments, as shown in FIG. 11, the relative longitudinal position for the remote vehicle may be identified as being behind the host vehicle (XW=10), and A₂<=δ_(HV)<2π or 0<=δ_(HV)<A₉ may indicate that the relative longitudinal position for the remote vehicle is behind the host vehicle, where A₁=β₁+π/2−φ_(P), A₂=β₁+π/2+φ_(P), A₉=β₁−π/2−φ_(P), and A₁₀=β₁−π/2+φ_(P).

For example, determining that the relative longitudinal position for the remote vehicle is behind the host vehicle may be expressed as the following:

$\begin{matrix} {B_{Q_{2}} = {{{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - 0 + \sigma}{{{\delta_{HV} - 0}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{A_{9} - \delta_{HV} - \sigma}{{{A_{9} - \delta_{HV}}} + \sigma} + 1} \right\rbrack} + {{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - A_{2} + \sigma}{{{\delta_{HV} - A_{2}}} + \sigma} + 1} \right\rbrack} \times {\left\lbrack {\frac{{2\; \pi} - \delta_{HV} - \sigma}{{{2\; \pi} - \delta_{HV}}{+ \sigma}} + 1} \right\rbrack.}}}} & \left\lbrack {{Equation}\mspace{14mu} 15} \right\rbrack \end{matrix}$

In some embodiments, for the second orientation sector Q₂, a relative lateral position for the remote vehicle (VU) may be identified based on host vehicle information, such as a geospatial location of the host vehicle, remote vehicle information, such as a geospatial location of the remote vehicle, or a combination thereof.

FIG. 12 is a diagram of identifying inter-vehicle state information including relative lateral position information for the remote vehicle (VU) for a second orientation sector Q₂ for use in generating converging path information in accordance with this disclosure. Identifying inter-vehicle state information including the relative lateral position for the remote vehicle (VU) for the second orientation sector for use in generating converging path information may be similar to the identification shown in FIG. 8, except as described herein. In some embodiments, the relative lateral position for the remote vehicle may be identified as being in-line with, or in the same lane as, the host vehicle (VU=00), a remote vehicle heading angle δ_(RV) may indicate a heading angle for the remote vehicle, which may correspond with expected path for the remote vehicle, a host vehicle heading angle δ_(HV) may indicate a heading angle for the host vehicle, which may correspond with an expected path for the host vehicle, an angular offset threshold φ_(I) may define an angular range in which the relative lateral position for the remote vehicle may be determined to be in-line with the host vehicle, and A₅<=δ_(HV)<A₆ or A₇<=δ_(HV)≦A₈ may indicate that the remote vehicle is in-line with the host vehicle, where A₅=β₁−φ_(I), A₆=β₁+φ_(I), A₇=β₁+π−φ_(I), and A₈=β₁+π+φ_(I).

For example, determining that the relative lateral position for the remote vehicle is in-line with the host vehicle may be expressed as the following:

$\begin{matrix} {I_{Q_{2}} = {{{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - A_{5} + \sigma}{{{\delta_{HV} - A_{5}}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{A_{6} - \delta_{HV} - \sigma}{{{A_{6} - \delta_{HV}}} + \sigma} + 1} \right\rbrack} + {{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - A_{7} + \sigma}{{{\delta_{HV} - A_{7}}} + \sigma} + 1} \right\rbrack} \times {\left\lbrack {\frac{A_{8} - \delta_{HV} - \sigma}{{{A_{8} - \delta_{HV}}} + \sigma} + 1} \right\rbrack.}}}} & \left\lbrack {{Equation}\mspace{14mu} 16} \right\rbrack \end{matrix}$

In some embodiments, as shown in FIG. 12, the relative lateral position for the remote vehicle may be identified as being to the left of the host vehicle (VU=01), and A₆≦=δ_(HV)≦A₇ may indicate that the relative lateral position for the remote vehicle is to the left of the host vehicle, where A₆=β₁+φ_(I) and A₇=β₁+π−φ_(I).

For example, determining that the relative lateral position for the remote vehicle is to the left of the host vehicle may be expressed as the following:

$\begin{matrix} {L_{Q_{2}} = {{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - A_{6} + \sigma}{{{\delta_{HV} - A_{6}}} + \sigma} + 1} \right\rbrack} \times {\left\lbrack {\frac{A_{7} - \delta_{HV} - \sigma}{{{A_{7} - \delta_{HV}}} + \sigma} + 1} \right\rbrack.}}} & \left\lbrack {{Equation}\mspace{14mu} 17} \right\rbrack \end{matrix}$

In some embodiments, as shown in FIG. 12, the relative lateral position for the remote vehicle may be identified as being to the right of the host vehicle (VU=10), and 0≦=δ_(HV)≦A₅ or A₈≦=δ_(HV)≦2π may indicate that the relative lateral position for the remote vehicle is to the right of the host vehicle, where A₅=β₁-φ_(I) and A₈=β₁+π+φ_(I).

For example, determining that the relative lateral position for the remote vehicle is to the right of the host vehicle may be expressed as the following:

$\begin{matrix} {R_{Q_{2}} = {{{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - 0 + \sigma}{{{\delta_{HV} - 0}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{A_{5} - \delta_{HV} - \sigma}{{{A_{5} - \delta_{HV}}} + \sigma} + 1} \right\rbrack} + {{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - A_{8} + \sigma}{{{\delta_{HV} - A_{8}}} + \sigma} + 1} \right\rbrack} \times {\left\lbrack {\frac{{2\; \pi} - \delta_{HV} - \sigma}{{{2\; \pi} - \delta_{HV}}{+ \sigma}} + 1} \right\rbrack.}}}} & \left\lbrack {{Equation}\mspace{14mu} 18} \right\rbrack \end{matrix}$

In an example, for the second orientation sector Q₂, determining relative position information may be expressed as shown in the following table:

TABLE 16 Lateral Position Q2 RV in lane (I_(Q) ₂ ) RV Left (L_(Q) ₂ ) RV Right (R_(Q) ₂ ) Longitudinal RV Ahead (P_(Q) ₂ ) Q ₂ × P_(Q) ₂ × I_(Q) ₂ Q ₂ × P_(Q) ₂ × L_(Q) ₂ Q ₂ × P_(Q) ₂ × R_(Q) ₂ Position RV Adjacent (A_(Q) ₂ ) Q ₂ × A_(Q) ₂ × I_(Q) ₂ Q ₂ × A_(Q) ₂ × L_(Q) ₂ Q ₂ × A_(Q) ₂ × R_(Q) ₂ RV Behind (B_(Q) ₂ ) Q ₂ × B_(Q) ₂ × I_(Q) ₂ Q ₂ × B_(Q) ₂ × L_(Q) ₂ Q ₂ × B_(Q) ₂ × R_(Q) ₂

In some embodiments, a remote vehicle (RV) may be identified in the third orientation sector Q₃, to the southwest of the host vehicle (HV), as shown in FIGS. 13-16. For example, the latitude of the remote vehicle may be less than the latitude for the host vehicle, the longitude for remote vehicle may be less than the longitude for the host vehicle, and the remote vehicle may be identified as being in the third orientation sector Q₃, which may be expressed as the following:

$\begin{matrix} {Q_{3} = {{\frac{1}{4}\left\lbrack {\frac{\varphi_{HV} - \varphi_{RV} - \sigma}{{{\varphi_{HV} - \varphi_{RV}}} + \sigma} + 1} \right\rbrack} \times {\left\lbrack {\frac{\theta_{HV} - \theta_{RV} + \sigma}{{{\theta_{HV} - \theta_{RV}}} + \sigma} + 1} \right\rbrack.}}} & \left\lbrack {{Equation}\mspace{14mu} 19} \right\rbrack \end{matrix}$

For example, the latitude of the remote vehicle may be less than the latitude for the host vehicle, the longitude for remote vehicle may be less than the longitude for the host vehicle, Equation 19 may evaluate to one, and the remote vehicle may be identified as being in the third orientation sector Q₃. In some embodiments, the remote vehicle may be in an orientation sector other than the third orientation sector Q₃ and Equation 19 may evaluate to zero.

FIG. 13 is a diagram of identifying inter-vehicle state information including a geodesic for a third orientation sector Q₃ for use in generating converging path information in accordance with this disclosure. Identifying inter-vehicle state information including a geodesic for a third orientation sector for use in generating converging path information may be similar to the identification shown in FIG. 5, except as described herein. In the third orientation sector Q₃ the remote vehicle, and the geodesic, is located to the southwest of the host vehicle in the geospatial domain.

In some embodiments, as shown in FIG. 13, for the third orientation sector, generating converging path information may include determining a host vehicle region for the host vehicle. A first host vehicle region may include host vehicle heading angles δ_(HV) from the reference direction, which may correspond with north, to a difference of the convergence angle β₁ of the geodesic and 180 degrees π, which may be expressed as 0≦=δ_(HV)≦β₁−π. A second host vehicle region may include host vehicle heading angles δ_(HV) from the difference of the convergence angle β₁ of the geodesic and 180 degrees to ninety degrees, which may correspond with east, and which may be expressed as β₁−π≦=δ_(HV)≦π/2. A third host vehicle region may include host vehicle heading angles δ_(HV) from ninety degrees to 180 degrees, which may correspond with south, and which may be expressed as π/2≦=δ_(HV)≦π. A fourth host vehicle region may include host vehicle heading angles δ_(HV) from 180 degrees to the convergence angle β₁ of the geodesic, which may be expressed as π≦=δ_(HV)≦β₁. A fifth host vehicle region may include host vehicle heading angles δ_(HV) from the convergence angle β₁ of the geodesic, to 270 degrees, which may correspond with west, and which may be expressed as β₁≦=δ_(HV)≦3π/2. A sixth host vehicle region may include host vehicle heading angles δ_(HV) from 270 degrees to 360 degrees, which may correspond with the reference direction, north, and which may be expressed as 3π/2≦=δ_(HV)≦2π.

In some embodiments, as shown in FIG. 13, for the third orientation sector, generating converging path information may include determining a remote vehicle region for the remote vehicle. A first remote vehicle region may include remote vehicle heading angles δ_(RV) from the reference direction, which may correspond with north, to a difference of the convergence angle β₁ of the geodesic and 180 degrees π, which may be expressed as 0≦=δ_(RV)≦β₁−π. A second remote vehicle region may include remote vehicle heading angles δ_(RV) from the difference of the convergence angle β₁ of the geodesic and 180 degrees to ninety degrees, which may correspond with east, and which may be expressed as β₁−π<=δ_(RV)≦π/2. A third remote vehicle region may include remote vehicle heading angles δ_(RV) from ninety degrees to 180 degrees, which may correspond with south, and which may be expressed as π/2≦=δ_(RV)≦π. A fourth remote vehicle region may include remote vehicle heading angles δ_(RV) from 180 degrees to the convergence angle β₁ of the geodesic, which may be expressed as π≦=δ_(RV)≦β₁. A fifth remote vehicle region may include remote vehicle heading angles δ_(RV) from the convergence angle β₁ of the geodesic, to 270 degrees, which may correspond with west, and which may be expressed as β₁≦=δ_(RV)≦3π/2. A sixth remote vehicle region may include remote vehicle heading angles δ_(RV) from 270 degrees to 360 degrees, which may correspond with the reference direction, north, and which may be expressed as 3π/2<=δ_(RV)<2π.

FIG. 14 is a diagram of identifying inter-vehicle state information including convergence information for the third orientation sector for use in generating converging path information in accordance with this disclosure. Identifying inter-vehicle state information including a geodesic for the third orientation sector for use in generating converging path information may be similar to the identification shown in FIG. 6, except as described herein.

In some embodiments, for the third orientation sector Q₃, generating converging path information may include identifying a host vehicle expected path 14000 for the host vehicle (HV), identifying respective remote vehicle expected paths 14100 for one or more of the remote vehicles (RV), or identifying respective expected paths 14000/14100 for the host vehicle and for one or more of the remote vehicles. In some embodiments, the expected paths may be projected, such as in a straight line, from the respective heading information.

In some embodiments, generating converging path information may include determining whether the remote vehicle expected path 14100 and the host vehicle expected path 14000 are convergent, which may indicate that the host vehicle expected path 14000 and the respective remote vehicle expected path 14100 intersect.

In some embodiments, for the third orientation sector Q₃, determining whether the remote vehicle expected path 14100 and the host vehicle expected path 14000 are convergent may include examining defined convergence data, such as the defined convergence data shown in Table 17.

TABLE 17 RV₁ RV₂ RV₃ RV₄ RV₅ RV₆ HV₁ η_(RV) 0 0 0 0 0 HV₂ 0 η_(HV) 0 0 0 0 HV₃ 0 1 η_(HV) 0 0 0 HV₄ 0 1 1 η_(HV) 0 0 HV₅ 1 0 0 0 η_(RV) 1 HV₆ 1 0 0 0 0 η_(RV)

In some embodiments, for the third orientation sector Q₃, determining η_(HV) may be expressed as shown in Equation 37. In some embodiments, determining η_(RV) may be expressed as shown in Equation 38.

In some embodiments, for the third orientation sector Q₃, a combination (F_(m,n)) of the host vehicle heading angle δ_(HV) and the remote vehicle heading angle δ_(RV) may be expressed as shown in Tables 18-20.

TABLE 18 F_(m,n) RV₁ RV₂ RV₃ RV₄ RV₅ RV₆ HV₁ H₁ × R₁ H₁ × R₂ H₁ × R₃ H₁ × R₄ H₁ × R₅ H₁ × R₆ HV₂ H₂ × R₁ H₂ × R₂ H₂ × R₃ H₂ × R₄ H₂ × R₅ H₂ × R₆ HV₃ H₃ × R₁ H₃ × R₂ H₃ × R₃ H₃ × R₄ H₃ × R₅ H₃ × R₆ HV₄ H₄ × R₁ H₄ × R₂ H₄ × R₃ H₄ × R₄ H₄ × R₅ H₄ × R₆ HV₅ H₅ × R₁ H₅ × R₂ H₅ × R₃ H₅ × R₄ H₅ × R₅ H₅ × R₆ HV₆ H₆ × R₁ H₆ × R₂ H₆ × R₃ H₆ × R₄ H₆ × R₅ H₆ × R₆

TABLE 19 H₁ ${\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - 0 - \sigma}{{{\delta_{HV} - 0}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{\beta_{1} - \pi - \delta_{HV} - \sigma}{{{\beta_{1} - \pi - \delta_{HV}}} + \sigma} + 1} \right\rbrack$ H₂ ${\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - \left( {\beta_{1} - \pi} \right) - \sigma}{{{\delta_{HV} - \left( {\beta_{1} - \pi} \right)}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{\frac{\pi}{2} - \delta_{HV} - \sigma}{{{\frac{\pi}{2} - \delta_{HV}}} + \sigma} + 1} \right\rbrack$ H₃ ${\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - \frac{\pi}{2} - \sigma}{{{\delta_{HV} - \frac{\pi}{2}}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{\pi - \delta_{HV} - \sigma}{{{\pi - \delta_{HV}}} + \sigma} + 1} \right\rbrack$ H₄ ${\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - \pi - \sigma}{{{\delta_{HV} - \pi}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{\beta_{1} - \delta_{HV} - \sigma}{{{\beta_{1} - \delta_{HV}}} + \sigma} + 1} \right\rbrack$ H₅ ${\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - \beta_{1} - \sigma}{{{\delta_{HV} - \beta_{1}}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{\frac{3\pi}{2} - \delta_{HV} - \sigma}{{{\frac{3\pi}{2} - \delta_{HV}}} + \sigma} + 1} \right\rbrack$ H₆ ${\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - \frac{3\pi}{2} - \sigma}{{{\delta_{HV} - \frac{3\pi}{2}}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{{2\pi} - \delta_{HV} - \sigma}{{{{2\pi} - \delta_{HV}}} + \sigma} + 1} \right\rbrack$

TABLE 20 R₁ ${\frac{1}{4}\left\lbrack {\frac{\delta_{RV} - 0 - \sigma}{{{\delta_{RV} - 0}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{\beta_{1} - \pi - \delta_{RV} - \sigma}{{{\beta_{1} - \pi - \delta_{RV}}} + \sigma} + 1} \right\rbrack$ R₂ ${\frac{1}{4}\left\lbrack {\frac{\delta_{RV} - \left( {\beta_{1} - \pi} \right) - \sigma}{{{\delta_{RV} - \left( {\beta_{1} - \pi} \right)}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{\frac{\pi}{2} - \delta_{RV} - \sigma}{{{\frac{\pi}{2} - \delta_{RV}}} + \sigma} + 1} \right\rbrack$ R₃ ${\frac{1}{4}\left\lbrack {\frac{\delta_{RV} - \frac{\pi}{2} - \sigma}{{{\delta_{RV} - \frac{\pi}{2}}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{\pi - \delta_{RV} - \sigma}{{{\pi - \delta_{RV}}} + \sigma} + 1} \right\rbrack$ R₄ ${\frac{1}{4}\left\lbrack {\frac{\delta_{RV} - \pi - \sigma}{{{\delta_{RV} - \pi}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{\beta_{1} - \delta_{RV} - \sigma}{{{\beta_{1} - \delta_{RV}}} + \sigma} + 1} \right\rbrack$ R₅ ${\frac{1}{4}\left\lbrack {\frac{\delta_{RV} - \beta_{1} - \sigma}{{{\delta_{RV} - \beta_{1}}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{\frac{3\pi}{2} - \delta_{RV} - \sigma}{{{\frac{3\pi}{2} - \delta_{RV}}} + \sigma} + 1} \right\rbrack$ R₆ ${\frac{1}{4}\left\lbrack {\frac{\delta_{RV} - \frac{3\pi}{2} - \sigma}{{{\delta_{RV} - \frac{3\pi}{2}}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{{2\pi} - \delta_{RV} - \sigma}{{{{2\pi} - \delta_{RV}}} + \sigma} + 1} \right\rbrack$

In some embodiments, for the third orientation sector Q₃, generating converging path information may include determining a host vehicle approach angle α_(HV) for the host vehicle based on the host vehicle region HV_(n), the remote vehicle region RV_(n), the host vehicle heading angle δ_(HV), and the convergence angle β₁, as expressed in Table 21.

TABLE 21 α_(HV) = RV₁ RV₂ RV₃ RV₄ RV₅ RV₆ HV₁ δ_(HV) − β₁ + 2π δ_(HV) − β₁ + 2π δ_(HV) − β₁ + 2π δ_(HV) − β₁ + 2π δ_(HV) − β₁ + 2π δ_(HV) − β₁ + 2π HV₂ −(δ_(HV) − β₁) −(δ_(HV) − β₁) −(δ_(HV) − β₁) −(δ_(HV) − β₁) −(δ_(HV) − β₁) −(δ_(HV) − β₁) HV₃ −(δ_(HV) − β₁) −(δ_(HV) − β₁) −(δ_(HV) − β₁) −(δ_(HV) − β₁) −(δ_(HV) − β₁) −(δ_(HV) − β₁) HV₄ −(δ_(HV) − β₁) −(δ_(HV) − β₁) −(δ_(HV) − β₁) −(δ_(HV) − β₁) −(δ_(HV) − β₁) −(δ_(HV) − β₁) HV₅ δ_(HV) − β₁ δ_(HV) − β₁ δ_(HV) − β₁ δ_(HV) − β₁ δ_(HV) − β₁ δ_(HV) − β₁ HV₆ δ_(HV) − β₁ δ_(HV) − β₁ δ_(HV) − β₁ δ_(HV) − β₁ δ_(HV) − β₁ δ_(HV) − β₁

In some embodiments, for the third orientation sector Q₃, generating converging path information may include determining a remote vehicle approach angle α_(RV) for the remote vehicle based on the host vehicle region HV_(n), the remote vehicle region RV_(n), the remote vehicle heading angle δ_(RV), and the convergence angle β₁, as expressed in Table 22.

TABLE 22 α_(RV) = RV₁ RV₂ RV₃ RV₄ RV₅ RV₆ HV₁ −(δ_(RV) − β₁ + π) 0 0 0 0 0 HV₂ 0 δ_(RV) − β₁ + π 0 0 0 0 HV₃ 0 δ_(RV) − β₁ + π δ_(RV) − β₁ + π 0 0 0 HV₄ 0 δ_(RV) − β₁ + π δ_(RV) − β₁ + π δ_(RV) − β₁ + π 0 0 HV₅ −(δ_(RV) − β₁ + π) 0 0 0 −(δ_(RV) − β₁ − π) −(δ_(RV) − β₁ − π) HV₆ −(δ_(RV) − β₁ + π) 0 0 0 0 −(δ_(RV) − β₁ − π)

In some embodiments, for the third orientation sector Q₃, generating converging path information may include determining an intersection angle α_(RV) based on the host vehicle region HV_(n), the remote vehicle region RV_(n), the host vehicle heading angle δ_(HV), and the remote vehicle heading angle δ_(RV), as expressed in Table 23.

TABLE 23 α_(D) = RV₁ RV₂ RV₃ RV₄ RV₅ RV₆ HV₁ −(δ_(HV) − δ_(RV)) 0 0 0 0 0 HV₂ 0 δ_(HV) − δ_(RV) 0 0 0 0 HV₃ 0 δ_(HV) − δ_(RV) δ_(HV) − δ_(RV) 0 0 0 HV₄ 0 δ_(HV) − δ_(RV) δ_(HV) − δ_(RV) δ_(HV) − δ_(RV) 0 0 HV₅ 2π − (δ_(HV) − δ_(RV)) 0 0 0 −(δ_(HV) − δ_(RV)) −(δ_(HV) − δ_(RV)) HV₆ 2π − (δ_(HV) − δ_(RV)) 0 0 0 0 −(δ_(HV) − δ_(RV))

In FIG. 14, L_(HV) indicates a distance from the host vehicle to the projected point of convergence with the remote vehicle expected path 14100, and L_(RV) indicates a distance from the remote vehicle to the projected point of convergence with the host vehicle expected path 14000.

In some embodiments, for the third orientation sector Q₃, determining the relative position information for the remote vehicle may include determining a relative longitudinal position for the remote vehicle (XW), as shown in FIG. 15, a relative lateral position for the remote vehicle (VU), as shown in FIG. 16, or both. For simplicity and clarity, in FIGS. 15 and 16, the host vehicle is shown as heading southwest and the remote vehicle heading is omitted.

FIG. 15 is a diagram of identifying inter-vehicle state information including longitudinal position for the remote vehicle (XW) for a third orientation sector Q₃ for use in generating converging path information in accordance with this disclosure. Identifying inter-vehicle state information including the longitudinal position for the remote vehicle (XW) for the third orientation sector for use in generating converging path information may be similar to the identification shown in FIG. 7, except as described herein. In some embodiments a longitudinal position of the remote vehicle (XW) may be identified based on host vehicle information, such as a geospatial location of the host vehicle, remote vehicle information, such as a geospatial location of the remote vehicle, or a combination thereof.

In some embodiments, as shown in FIG. 15, the relative longitudinal position for the remote vehicle may be identified as being ahead of the host vehicle (XW=00), a remote vehicle heading angle δ_(RV) may indicate a heading angle for the remote vehicle, which may correspond with expected path for the remote vehicle, a host vehicle heading angle δ_(HV) may indicate a heading angle for the host vehicle, which may correspond with expected path for the host vehicle, an angular offset threshold φ_(P) may define an angular range in which the remote vehicle may be determined to be adjacent to the host vehicle, and A₁₂<=δ_(HV)<A₁ may indicate that the relative longitudinal position for the remote vehicle is ahead of the host vehicle, where A₁=β₁+π/2−φ_(P) and A₁₀=β₁−π/2+φ_(P).

For example, determining that the relative longitudinal position for the remote vehicle is ahead of the host vehicle may be expressed as the following:

$\begin{matrix} {P_{Q_{3}} = {{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - A_{10} + \sigma}{{{\delta_{HV} - A_{10}}} + \sigma} + 1} \right\rbrack} \times {\left\lbrack {\frac{A_{1} - \delta_{HV} - \sigma}{{{A_{1} - \delta_{HV}}} + \sigma} + 1} \right\rbrack.}}} & \left\lbrack {{Equation}\mspace{14mu} 20} \right\rbrack \end{matrix}$

In some embodiments, as shown in FIG. 15, the relative longitudinal position for the remote vehicle may be identified as being adjacent to the host vehicle (XW=01), and A₁<=δ_(HV)<A₂ or A₉<=δ_(HV)<A₁₀ may indicate that the relative longitudinal position for the remote vehicle is adjacent to the host vehicle, where A₁=β₁+π/2−φ_(P), A₂=β₁+π/2+φ_(P), A₉=β₁−π/2−φ_(P), and A₁₀=β₁−π/2+φ_(P).

For example, determining that the relative longitudinal position for the remote vehicle is adjacent to the host vehicle may be expressed as the following:

$\begin{matrix} {A_{Q_{3}} = {{{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - A_{1} + \sigma}{{{\delta_{HV} - A_{1}}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{A_{2} - \delta_{HV} - \sigma}{{{A_{2} - \delta_{HV}}} + \sigma} + 1} \right\rbrack} + {{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - A_{9} + \sigma}{{{\delta_{HV} - A_{9}}} + \sigma} + 1} \right\rbrack} \times {\left\lbrack {\frac{A_{10} - \delta_{HV} - \sigma}{{{A_{10} - \delta_{HV}}} + \sigma} + 1} \right\rbrack.}}}} & \left\lbrack {{Equation}\mspace{14mu} 21} \right\rbrack \end{matrix}$

In some embodiments, as shown in FIG. 15, the relative longitudinal position for the remote vehicle may be identified as being behind the host vehicle (XW=10), and A₂<=δ_(HV)<2π or 0<=δ_(HV)<A₉ may indicate that the relative longitudinal position for the remote vehicle is behind the host vehicle, where A₂=β₁+π/2+φ_(P), and A₉=β₁−π/2−φ_(P).

For example, determining that the relative longitudinal position for the remote vehicle is behind the host vehicle may be expressed as the following:

$\begin{matrix} {B_{Q_{3}} = {{{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - 0 + \sigma}{{{\delta_{HV} - 0}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{A_{9} - \delta_{HV} - \sigma}{{{A_{9} - \delta_{HV}}} + \sigma} + 1} \right\rbrack} + {{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - A_{2} + \sigma}{{{\delta_{HV} - A_{2}}} + \sigma} + 1} \right\rbrack} \times {\left\lbrack {\frac{{2\; \pi} - \delta_{HV} - \sigma}{{{2\; \pi} - \delta_{HV}}{+ \sigma}} + 1} \right\rbrack.}}}} & \left\lbrack {{Equation}\mspace{14mu} 22} \right\rbrack \end{matrix}$

In some embodiments, for the third orientation sector Q₃, a relative lateral position for the remote vehicle (VU) may be identified based on host vehicle information, such as a geospatial location of the host vehicle, remote vehicle information, such as a geospatial location of the remote vehicle, or a combination thereof.

FIG. 16 is a diagram of identifying inter-vehicle state information including relative lateral position for the remote vehicle (VU) for a third orientation sector Q₃ for use in generating converging path information in accordance with this disclosure. Identifying inter-vehicle state information including the relative lateral position for the remote vehicle (VU) for the third orientation sector for use in generating converging path information may be similar to the identification shown in FIG. 8, except as described herein. In some embodiments, the relative lateral position for the remote vehicle may be identified as being in-line with, or in the same lane as, the host vehicle (VU=00), a remote vehicle heading angle δ_(RV) may indicate a heading angle for the remote vehicle, which may correspond with expected path for the remote vehicle, a host vehicle heading angle δ_(HV) may indicate a heading angle for the host vehicle, which may correspond with an expected path for the host vehicle, an angular offset threshold φ_(I) may define an angular range in which the relative lateral position for the remote vehicle may be determined to be in-line with the host vehicle, and A₁₁<=δ_(HV)<=δ_(HV)<A₁₂ or A₁₃<=<A₁₄ may indicate that the relative lateral position for the remote vehicle is in-line with the host vehicle, where A₁₁=β₁−π−φ_(I), A₁₂=β₁−π+φ_(I), A₁₃=β₁−φ_(I), and A₁₄=β₁+φ_(I).

For example, determining that the relative lateral position for the remote vehicle is in-line with the host vehicle may be expressed as the following:

$\begin{matrix} {I_{Q_{3}} = {{{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - A_{11} + \sigma}{{{\delta_{HV} - A_{11}}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{A_{12} - \delta_{HV} - \sigma}{{{A_{12} - \delta_{HV}}} + \sigma} + 1} \right\rbrack} + {{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - A_{13} + \sigma}{{{\delta_{HV} - A_{13}}} + \sigma} + 1} \right\rbrack} \times {\left\lbrack {\frac{A_{14} - \delta_{HV} - \sigma}{{{A_{14} - \delta_{HV}}} + \sigma} + 1} \right\rbrack.}}}} & \left\lbrack {{Equation}\mspace{14mu} 23} \right\rbrack \end{matrix}$

In some embodiments, as shown in FIG. 16, the relative lateral position for the remote vehicle may be identified as being to the left of the host vehicle (VU=01), and 0<=δ_(HV)<A₁₁ or A₁₄<=δ_(HV)<2π may indicate that the relative lateral position for the remote vehicle is to the left of the host vehicle, where A₁₁=β₁−π−φ_(I), A₁₂=β₁−π+φ_(I), A₁₃=β₁−φ_(I), and A₁₄=β₁+φ_(I).

For example, determining that the relative lateral position for the remote vehicle is to the left of the host vehicle may be expressed as the following:

$\begin{matrix} {L_{Q_{3}} = {{{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - 0 + \sigma}{{{\delta_{HV} - 0}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{A_{11} - \delta_{HV} - \sigma}{{{A_{11} - \delta_{HV}}} + \sigma} + 1} \right\rbrack} + {{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - A_{14} + \sigma}{{{\delta_{HV} - A_{14}}} + \sigma} + 1} \right\rbrack} \times {\left\lbrack {\frac{{2\; \pi} - \delta_{HV} - \sigma}{{{{2\; \pi} - \delta_{HV}}} + \sigma} + 1} \right\rbrack.}}}} & \left\lbrack {{Equation}\mspace{14mu} 24} \right\rbrack \end{matrix}$

In some embodiments, as shown in FIG. 16, the relative lateral position for the remote vehicle may be identified as being to the right of the host vehicle (VU=10), and A₁₂<=δ_(HV)<A₁₃ may indicate that the relative lateral position for the remote vehicle is to the right of the host vehicle, where A₁₁=β₁−π−φ_(I), A₁₂=β₁−π+φ_(I), A₁₃=β₁−φ_(I), and A₁₄=β₁+φ_(I).

For example, determining that the relative lateral position for the remote vehicle is to the right of the host vehicle may be expressed as the following:

$\begin{matrix} {R_{Q_{3}} = {{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - A_{12} + \sigma}{{{\delta_{HV} - A_{12}}} + \sigma} + 1} \right\rbrack} \times {\left\lbrack {\frac{A_{13} - \delta_{HV} - \sigma}{{{A_{13} - \delta_{HV}}} + \sigma} + 1} \right\rbrack.}}} & \left\lbrack {{Equation}\mspace{14mu} 25} \right\rbrack \end{matrix}$

In an example, for the third orientation sector Q₃, determining relative position information may be expressed as shown in the following table:

TABLE 24 Lateral Position Q₃ RV in lane (I_(Q) ₃ ) RV Left (L_(Q) ₃ ) RV Right (R_(Q) ₃ ) Longitudinal RV Ahead (P_(Q) ₃ ) Q₃ × P_(Q) ₃ × I_(Q) ₃ Q₃ × P_(Q) ₃ × L_(Q) ₃ Q₃ × P_(Q) ₃ × R_(Q) ₃ Position RV Adjacent (A_(Q) ₃ ) Q₃ × A_(Q) ₃ × I_(Q) ₃ Q₃ × A_(Q) ₃ × L_(Q) ₃ Q₃ × A_(Q) ₃ × R_(Q) ₃ RV Behind (B_(Q) ₃ ) Q₃ × B_(Q) ₃ × I_(Q) ₃ Q₃ × B_(Q) ₃ × L_(Q) ₃ Q₃ × B_(Q) ₃ × R_(Q3)

In some embodiments, a remote vehicle (RV) may be identified in the fourth orientation sector Q₄, to the northwest of the host vehicle (HV), as shown in FIGS. 17-20. For example, the latitude of the remote vehicle may be greater than the latitude for the host vehicle, the longitude for remote vehicle may be less than the longitude for the host vehicle, and the remote vehicle may be identified as being in the fourth orientation sector Q₄, which may be expressed as the following:

$\begin{matrix} {Q_{4} = {{\frac{1}{4}\left\lbrack {\frac{\varphi_{RV} - \varphi_{HV} + \sigma}{{{\varphi_{RV} - \varphi_{HV}}} + \sigma} + 1} \right\rbrack} \times {\left\lbrack {\frac{\theta_{HV} - \theta_{RV} - \sigma}{{{\theta_{HV} - \theta_{RV}}} + \sigma} + 1} \right\rbrack.}}} & \left\lbrack {{Equation}\mspace{14mu} 26} \right\rbrack \end{matrix}$

For example, the latitude of the remote vehicle may be greater than the latitude for the host vehicle, the longitude for remote vehicle may be less than the longitude for the host vehicle, Equation 26 may evaluate to one, and the remote vehicle may be identified as being in the fourth orientation sector Q₄. In some embodiments, the remote vehicle may be in an orientation sector other than the fourth orientation sector Q₄ and Equation 26 may evaluate to zero.

FIG. 17 is a diagram of identifying inter-vehicle state information including a geodesic for a fourth orientation sector for use in generating converging path information in accordance with this disclosure. Identifying inter-vehicle state information including a geodesic for a fourth orientation sector for use in generating converging path information may be similar to the identification shown in FIG. 5, except as described herein. In the fourth orientation sector Q₄ the remote vehicle, and the geodesic, is located to the northwest of the host vehicle in the geospatial domain.

In some embodiments, as shown in FIG. 17, for the fourth orientation sector Q₄, generating converging path information may include determining a host vehicle region for the host vehicle. A first host vehicle region may include host vehicle heading angles δ_(HV) from the reference direction, which may correspond with north, to ninety degrees, which may correspond with east, and which may be expressed as 0<=δ_(HV)<π/2. A second host vehicle region may include host vehicle heading angles δ_(HV) from ninety degrees to a difference of the convergence angle β₁ of the geodesic and 180 degrees π, which may be expressed as π/2<=δ_(HV)<β₁−π. A third host vehicle region may include host vehicle heading angles δ_(HV) from the difference of the convergence angle β₁ of the geodesic and 180 degrees π to 180 degrees, which may correspond with south, and which may be expressed as β₁−π<=δ_(HV)<π. A fourth host vehicle region may include host vehicle heading angles δ_(HV) from 180 degrees to 270 degrees, which may correspond with west, and which may be expressed as π<=δ_(HV)<3π/2. A fifth host vehicle region may include host vehicle heading angles δ_(HV) from 270 degrees to the convergence angle β₁ of the geodesic, which may be expressed as 3π/2<=δ_(HV)<β₁. A sixth host vehicle region may include host vehicle heading angles δ_(HV) from the convergence angle β₁ of the geodesic to 360 degrees, which may correspond with the reference direction, north, and which may be expressed as β₁<=δ_(HV)<2π.

In some embodiments, as shown in FIG. 17, for the fourth orientation sector, generating converging path information may include determining a remote vehicle region for the remote vehicle. A first remote vehicle region may include remote vehicle heading angles δ_(RV) from the reference direction, which may correspond with north, to ninety degrees, which may correspond with east, and which may be expressed as 0<=δ_(RV)<π/2. A second remote vehicle region may include remote vehicle heading angles δ_(RV) from ninety degrees to a difference of the convergence angle β₁ of the geodesic and 180 degrees π, which may be expressed as π/2<=δ_(RV)<β₁−π. A third remote vehicle region may include remote vehicle heading angles δ_(RV) from the difference of the convergence angle β₁ of the geodesic and 180 degrees π to 180 degrees, which may correspond with south, and which may be expressed as β₁−π<=δ_(RV)<π. A fourth remote vehicle region may include remote vehicle heading angles δ_(RV) from 180 degrees to 270 degrees, which may correspond with west, and which may be expressed as π<=δ_(RV)<3π/2. A fifth remote vehicle region may include remote vehicle heading angles δ_(RV) from 270 degrees to the convergence angle β₁ of the geodesic, which may be expressed as 3π/2<=δ_(RV)<β₁. A sixth remote vehicle region may include remote vehicle heading angles δ_(RV) from the convergence angle β₁ of the geodesic to 360 degrees, which may correspond with the reference direction, north, and which may be expressed as β₁<=δ_(RV)<2π.

FIG. 18 is a diagram of identifying inter-vehicle state information including convergence information for the fourth orientation sector for use in generating converging path information in accordance with this disclosure. Identifying inter-vehicle state information including a geodesic for a fourth orientation sector for use in generating converging path information may be similar to the identification shown in FIG. 6, except as described herein.

In some embodiments, for the fourth orientation sector Q₄, generating converging path information may include identifying a host vehicle expected path 18000 for the host vehicle (HV), identifying respective remote vehicle expected paths 18100 for one or more of the remote vehicles (RV), or identifying respective expected paths 18000/18100 for the host vehicle and for one or more of the remote vehicles. In some embodiments, the expected paths may be projected, such as in a straight line, from the respective heading information.

In some embodiments, generating converging path information may include determining whether the remote vehicle expected path 18100 and the host vehicle expected path 18000 are convergent, which may indicate that the host vehicle expected path 18000 and the respective remote vehicle expected path 18100 intersect.

In some embodiments, for the fourth orientation sector Q₄, determining whether the remote vehicle expected path 18100 and the host vehicle expected path 18000 are convergent may include examining defined convergence data, such as the defined convergence data shown in Table 25.

TABLE 25 RV₁ RV₂ RV₃ RV₄ RV₅ RV₆ HV₁ η_(RV) 1 0 0 0 0 HV₂ 0 η_(RV) 0 0 0 0 HV₃ 0 0 η_(HV) 0 0 0 HV₄ 0 0 1 η_(HV) 0 0 HV₅ 0 0 1 1 η_(HV) 0 HV₆ 1 1 0 0 1 η_(RV)

In some embodiments, determining η_(HV) may be expressed as shown in Equation 37. In some embodiments, determining η_(RV) may be expressed as shown in Equation 38.

In some embodiments, for the fourth orientation sector Q₄, a combination (F_(m,n)) of the host vehicle heading angle δ_(HV) and the remote vehicle heading angle δ_(RV) may be expressed as shown in Tables 26-28.

TABLE 26 F_(m,n) RV₁ RV₂ RV₃ RV₄ RV₅ RV₆ HV₁ H₁ × R₁ H₁ × R₂ H₁ × R₃ H₁ × R₄ H₁ × R₅ H₁ × R₆ HV₂ H₂ × R₁ H₂ × R₂ H₂ × R₃ H₂ × R₄ H₂ × R₅ H₂ × R₆ HV₃ H₃ × R₁ H₃ × R₂ H₃ × R₃ H₃ × R₄ H₃ × R₅ H₃ × R₆ HV₄ H₄ × R₁ H₄ × R₂ H₄ × R₃ H₄ × R₄ H₄ × R₅ H₄ × R₆ HV₅ H₅ × R₁ H₅ × R₂ H₅ × R₃ H₅ × R₄ H₅ × R₅ H₅ × R₆ HV₆ H₆ × R₁ H₆ × R₂ H₆ × R₃ H₆ × R₄ H₆ × R₅ H₆ × R₆

TABLE 27 H₁ ${\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - 0 - \sigma}{{{\delta_{HV} - 0}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{\frac{\pi}{2} - \delta_{HV} - \sigma}{{{\frac{\pi}{2} - \delta_{HV}}} + \sigma} + 1} \right\rbrack$ H₂ ${\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - \frac{\pi}{2} - \sigma}{{{\delta_{HV} - \frac{\pi}{2}}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{\left( {\beta_{1} - \pi} \right) - \delta_{HV} - \sigma}{{{\left( {\beta_{1} - \pi} \right) - \delta_{HV}}} + \sigma} + 1} \right\rbrack$ H₃ ${\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - \left( {\beta_{1} - \pi} \right) - \sigma}{{{\delta_{HV} - \left( {\beta_{1} - \pi} \right)}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{\pi - \delta_{HV} - \sigma}{{{\pi - \delta_{HV}}} + \sigma} + 1} \right\rbrack$ H₄ ${\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - \pi - \sigma}{{{\delta_{HV} - \pi}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{\frac{3\pi}{2} - \delta_{HV} - \sigma}{{{\frac{3\pi}{2} - \delta_{HV}}} + \sigma} + 1} \right\rbrack$ H₅ ${\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - \frac{3\pi}{2} - \sigma}{{{\delta_{HV} - \frac{3\pi}{2}}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{\beta_{1} - \delta_{HV} - \sigma}{{{\beta_{1} - \delta_{HV}}} + \sigma} + 1} \right\rbrack$ H₆ ${\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - \beta_{1} - \sigma}{{{\delta_{HV} - \beta_{1}}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{{2\pi} - \delta_{HV} - \sigma}{{{{2\pi} - \delta_{HV}}} + \sigma} + 1} \right\rbrack$

TABLE 28 R₁ ${\frac{1}{4}\left\lbrack {\frac{\delta_{RV} - 0 - \sigma}{{{\delta_{RV} - 0}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{\frac{\pi}{2} - \delta_{RV} - \sigma}{{{\frac{\pi}{2} - \delta_{RV}}} + \sigma} + 1} \right\rbrack$ R₂ ${\frac{1}{4}\left\lbrack {\frac{\delta_{RV} - \frac{\pi}{2} - \sigma}{{{\delta_{RV} - \frac{\pi}{2}}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{\left( {\beta_{1} - \pi} \right) - \delta_{RV} - \sigma}{{{\left( {\beta_{1} - \pi} \right) - \delta_{RV}}} + \sigma} + 1} \right\rbrack$ R₃ ${\frac{1}{4}\left\lbrack {\frac{\delta_{RV} - \left( {\beta_{1} - \pi} \right) - \sigma}{{{\delta_{RV} - \left( {\beta_{1} - \pi} \right)}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{\pi - \delta_{RV} - \sigma}{{{\pi - \delta_{RV}}} + \sigma} + 1} \right\rbrack$ R₄ ${\frac{1}{4}\left\lbrack {\frac{\delta_{RV} - \pi - \sigma}{{{\delta_{RV} - \pi}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{\frac{3\pi}{2} - \delta_{RV} - \sigma}{{{\frac{3\pi}{2} - \delta_{RV}}} + \sigma} + 1} \right\rbrack$ R₅ ${\frac{1}{4}\left\lbrack {\frac{\delta_{RV} - \frac{3\pi}{2} - \sigma}{{{\delta_{RV} - \frac{3\pi}{2}}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{\beta_{1} - \delta_{RV} - \sigma}{{{\beta_{1} - \delta_{RV}}} + \sigma} + 1} \right\rbrack$ R₆ ${\frac{1}{4}\left\lbrack {\frac{\delta_{RV} - \beta_{1} - \sigma}{{{\delta_{RV} - \beta_{1}}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{{2\pi} - \delta_{RV} - \sigma}{{{{2\pi} - \delta_{RV}}} + \sigma} + 1} \right\rbrack$

In some embodiments, for the fourth orientation sector Q₄, generating converging path information may include determining a host vehicle approach angle α_(HV) for the host vehicle based on the host vehicle region HV_(n), the remote vehicle region RV_(n), the host vehicle heading angle δ_(HV), and the convergence angle β₁, as expressed in Table 29.

TABLE 29 α_(HV) = RV₁ RV₂ RV₃ RV₄ RV₅ RV₆ HV₁ δ_(HV) − β₁ + 2π δ_(HV) − β₁ + 2π δ_(HV) − β₁ + 2π δ_(HV) − β₁ + 2π δ_(HV) − β₁ + 2π δ_(HV) − β₁ + 2π HV₂ δ_(HV) − β₁ + 2π δ_(HV) − β₁ + 2π δ_(HV) − β₁ + 2π δ_(HV) − β₁ + 2π δ_(HV) − β₁ + 2π δ_(HV) − β₁ + 2π HV₃ −(δ_(HV) − β₁) −(δ_(HV) − β₁) −(δ_(HV) − β₁) −(δ_(HV) − β₁) −(δ_(HV) − β₁) −(δ_(HV) − β₁) HV₄ −(δ_(HV) − β₁) −(δ_(HV) − β₁) −(δ_(HV) − β₁) −(δ_(HV) − β₁) −(δ_(HV) − β₁) −(δ_(HV) − β₁) HV₅ −(δ_(HV) − β₁) −(δ_(HV) − β₁) −(δ_(HV) − β₁) −(δ_(HV) − β₁) −(δ_(HV) − β₁) −(δ_(HV) − β₁) HV₆ δ_(HV) − β₁ δ_(HV) − β₁ δ_(HV) − β₁ δ_(HV) − β₁ δ_(HV) − β₁ δ_(HV) − β₁

In some embodiments, for the fourth orientation sector Q₄, generating converging path information may include determining a remote vehicle approach angle α_(RV) for the remote vehicle based on the host vehicle region HV_(n), the remote vehicle region RV_(n), the remote vehicle heading angle δ_(RV), and the convergence angle β₁, as expressed in Table 30.

TABLE 30 α_(RV) = RV₁ RV₂ RV₃ RV₄ RV₅ RV₆ HV₁ −(δ_(RV) − β₁ + π) −(δ_(RV) − β₁ + π) 0 0 0 0 HV₂ 0 −(δ_(RV) − β₁ + π) 0 0 0 0 HV₃ 0 0 δ_(RV) − β₁ + π 0 0 0 HV₄ 0 0 δ_(RV) − β₁ + π δ_(RV) − β₁ + π 0 0 HV₅ 0 0 δ_(RV) − β₁ + π δ_(RV) − β₁ + π δ_(RV) − β₁ + π 0 HV₆ −(δ_(RV) − β₁ + π) −(δ_(RV) − β₁ + π) 0 0 0 −(δ_(RV) − β₁ − π)

In some embodiments, for the fourth orientation sector Q₄, generating converging path information may include determining an intersection angle α_(D) based on the host vehicle region HV_(n), the remote vehicle region RV_(n), the host vehicle heading angle δ_(HV), and the remote vehicle heading angle δ_(RV), as expressed in Table 31.

TABLE 31 α_(D) = RV₁ RV₂ RV₃ RV₄ RV₅ RV₆ HV₁ −(δ_(HV) − δ_(RV)) −(δ_(HV) − δ_(RV)) 0 0 0 0 HV₂ 0 −(δ_(HV) − δ_(RV)) 0 0 0 0 HV₃ 0 0 δ_(HV) − δ_(RV) 0 0 0 HV₄ 0 0 δ_(HV) − δ_(RV) δ_(HV) − δ_(RV) 0 0 HV₅ 0 0 δ_(HV) − δ_(RV) δ_(HV) − δ_(RV) δ_(HV) − δ_(RV) 0 HV₆ 2π + (δ_(HV) − δ_(RV)) 2π + (δ_(HV) − δ_(RV)) 0 0 0 −(δ_(HV) − δ_(RV))

In FIG. 18, L_(HV) indicates a distance from the host vehicle to the projected point of convergence with the remote vehicle expected path 18100, and L_(RV) indicates a distance from the remote vehicle to the projected point of convergence with the host vehicle expected path 18000.

In some embodiments, for the fourth orientation sector Q₄, determining the relative position information for the remote vehicle may include determining a relative longitudinal position for the remote vehicle (XW), as shown in FIG. 19, a relative lateral position for the remote vehicle (VU), as shown in FIG. 20, or both. For simplicity and clarity, in FIGS. 19 and 20, the host vehicle is shown as heading northwest and the remote vehicle heading is omitted.

FIG. 19 is a diagram of identifying inter-vehicle state information including longitudinal position for the remote vehicle (XW) for a fourth orientation sector Q₄ for use in generating converging path information in accordance with this disclosure. Identifying inter-vehicle state information including the longitudinal position for the remote vehicle (XW) for the fourth orientation sector for use in generating converging path information may be similar to the identification shown in FIG. 7, except as described herein. In some embodiments a relative longitudinal position of the remote vehicle (XW) may be identified based on host vehicle information, such as a geospatial location of the host vehicle, remote vehicle information, such as a geospatial location of the remote vehicle, or a combination thereof.

In some embodiments, as shown in FIG. 19, the relative longitudinal position of the remote vehicle may be identified as being ahead of the host vehicle (XW=00), a remote vehicle heading angle δ_(RV) may indicate a heading angle for the remote vehicle, which may correspond with expected path for the remote vehicle, a host vehicle heading angle δ_(HV) may indicate a heading angle for the host vehicle, which may correspond with expected path for the host vehicle, an angular offset threshold φ_(P) may define an angular range in which the relative longitudinal position of the remote vehicle may be determined to be adjacent to the host vehicle, and 0<=δ_(HV)<A₁₅ or A₁₀<=δ_(HV)<2π may indicate that the relative longitudinal position of the remote vehicle is ahead of the host vehicle, where A₁₅=β₁−3π/2−φ_(P), A₁₆=β₁−3π/2+φ_(P), A₉=β₁−π/2−φ_(P), and A₁₀=β₁−π/2+φ_(P).

For example, determining that the relative longitudinal position of the remote vehicle is ahead of the host vehicle may be expressed as the following:

$\begin{matrix} {P_{Q_{4}} = {{{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - 0 + \sigma}{{{\delta_{HV} - 0}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{A_{15} - \delta_{HV} - \sigma}{{{A_{15} - \delta_{HV}}} + \sigma} + 1} \right\rbrack} + {{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - A_{10} + \sigma}{{{\delta_{HV} - A_{10}}} + \sigma} + 1} \right\rbrack} \times {\left\lbrack {\frac{{2\; \pi} - \delta_{HV} - \sigma}{{{{2\; \pi} - \delta_{HV}}} + \sigma} + 1} \right\rbrack.}}}} & \left\lbrack {{Equation}\mspace{14mu} 27} \right\rbrack \end{matrix}$

In some embodiments, as shown in FIG. 19, the relative longitudinal position of the remote vehicle may be identified as being adjacent to the host vehicle (XW=01), and A₁₅<=δ_(HV)<A₁₆ or A₉<=δ_(HV)<A₁₀ may indicate that the relative longitudinal position of the remote vehicle is adjacent to the host vehicle, where A₁₅=β₁−3π/2−φ_(P), A₁₆=β₁−3π/2+φ_(P), A₉=β₁−π/2−φ_(P), and A₁₀=β₁−π/2+φ_(P).

For example, determining that the relative longitudinal position of the remote vehicle is adjacent to the host vehicle may be expressed as the following:

$\begin{matrix} {A_{Q_{4}} = {{{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - A_{15} + \sigma}{{{\delta_{HV} - A_{15}}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{A_{12} - \delta_{HV} - \sigma}{{{A_{12} - \delta_{HV}}} + \sigma} + 1} \right\rbrack} + {{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - A_{9} + \sigma}{{{\delta_{HV} - A_{9}}} + \sigma} + 1} \right\rbrack} \times {\left\lbrack {\frac{A_{10} - \delta_{HV} - \sigma}{{A_{10} - \delta_{HV}}{+ \sigma}} + 1} \right\rbrack.}}}} & \left\lbrack {{Equation}\mspace{14mu} 28} \right\rbrack \end{matrix}$

In some embodiments, as shown in FIG. 19, the relative longitudinal position of the remote vehicle may be identified as being behind the host vehicle (XW=10), and A₁₆<=δ_(HV)<A₉ may indicate that the relative longitudinal position of the remote vehicle is behind the host vehicle, where A₁₅=β₁−3π/2−φ_(P), A₁₆=β₁−3π/2+φ_(P), A₉=β₁−π/2−φ_(P), and A₁₀=β₁−π/2+φPD.

For example, determining that the relative longitudinal position of the remote vehicle is behind the host vehicle may be expressed as the following:

$\begin{matrix} {B_{Q_{4}} = {{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - A_{16} + \sigma}{{{\delta_{HV} - A_{16}}} + \sigma} + 1} \right\rbrack} \times {\left\lbrack {\frac{A_{9} - \delta_{HV} - \sigma}{{{A_{9} - \delta_{HV}}} + \sigma} + 1} \right\rbrack.}}} & \left\lbrack {{Equation}\mspace{14mu} 29} \right\rbrack \end{matrix}$

In some embodiments, for the fourth orientation sector Q₄, a relative lateral position of the remote vehicle (VU) may be identified based on host vehicle information, such as a geospatial location of the host vehicle, remote vehicle information, such as a geospatial location of the remote vehicle, or a combination thereof.

FIG. 20 is a diagram of identifying inter-vehicle state information including a relative lateral position of the remote vehicle (VU) for a fourth orientation sector Q₄ for use in generating converging path information in accordance with this disclosure. Identifying inter-vehicle state information including the relative lateral position of the remote vehicle (VU) for the fourth orientation sector for use in generating converging path information may be similar to the identification shown in FIG. 8, except as described herein. In some embodiments, the relative lateral position of the remote vehicle may be identified as being in-line with, or in the same lane as, the host vehicle (VU=00), a remote vehicle heading angle δ_(RV) may indicate a heading angle for the remote vehicle, which may correspond with expected path for the remote vehicle, a host vehicle heading angle δ_(HV) may indicate a heading angle for the host vehicle, which may correspond with an expected path for the host vehicle, an angular offset threshold φ_(I) may define an angular range in which the remote vehicle may be determined to be in-line with the host vehicle, and A₁₁<=δ_(HV)<A₁₂ or A₁₃<=δ_(HV)<A₁₄ may indicate that the relative lateral position of the remote vehicle is in-line with the host vehicle, where A₁₁=β₁−π−φ_(I), A₁₂=β₁−π+φ_(I), A₁₃=β₁−φ_(I), and A₁₄=β₁+φ_(I).

For example, determining that the relative lateral position of the remote vehicle is in-line with the host vehicle may be expressed as the following:

$\begin{matrix} {I_{Q_{4}} = {{{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - A_{11} + \sigma}{{{\delta_{HV} - A_{11}}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{A_{12} - \delta_{HV} - \sigma}{{{A_{12} - \delta_{HV}}} + \sigma} + 1} \right\rbrack} + {{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - A_{13} + \sigma}{{{\delta_{HV} - A_{13}}} + \sigma} + 1} \right\rbrack} \times {\left\lbrack {\frac{A_{14} - \delta_{HV} - \sigma}{\left. {A_{14} - \delta_{HV}} \middle| {+ \sigma} \right.} + 1} \right\rbrack.}}}} & \left\lbrack {{Equation}\mspace{14mu} 30} \right\rbrack \end{matrix}$

In some embodiments, as shown in FIG. 20, the relative lateral position of the remote vehicle may be identified as being to the left of the host vehicle (VU=01), and 0<=δ_(HH)<A₁₁ or A₁₄<=δ_(HV)<2π may indicate that the relative lateral position of the remote vehicle is to the left of the host vehicle, where A₁₁=β₁−π−φ_(I), A₁₂=β₁−π+φ_(I), A₁₃=β₁−φ_(I), and A₁₄=β1+φ_(I).

For example, determining that the relative lateral position of the remote vehicle is to the left of the host vehicle may be expressed as the following:

$\begin{matrix} {L_{Q_{4}} = {{{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - 0 + \sigma}{{{\delta_{HV} - 0}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{A_{11} - \delta_{HV} - \sigma}{{{A_{11} - \delta_{HV}}} + \sigma} + 1} \right\rbrack} + {{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - A_{14} + \sigma}{{{\delta_{HV} - A_{14}}} + \sigma} + 1} \right\rbrack} \times {\left\lbrack {\frac{{2\pi} - \delta_{HV} - \sigma}{{{{2\pi} - \delta_{HV}}} + \sigma} + 1} \right\rbrack.}}}} & \left\lbrack {{Equation}\mspace{14mu} 31} \right\rbrack \end{matrix}$

In some embodiments, as shown in FIG. 20, the relative lateral position of the remote vehicle may be identified as being to the right of the host vehicle (VU=10), and A₁₂<=δ_(HV)<A₁₃ may indicate that the relative lateral position of the remote vehicle is to the right of the host vehicle, where A₁₁=β₁−π−φ_(I), A₁₂=β₁−π+φ_(I), A₁₃=β₁−φ_(I), and A₁₄=β₁+φ_(I).

For example, determining that the relative lateral position of the remote vehicle is to the right of the host vehicle may be expressed as the following:

$\begin{matrix} {R_{Q_{4}} = {{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - A_{12} + \sigma}{{{\delta_{HV} - A_{12}}} + \sigma} + 1} \right\rbrack} \times {\left\lbrack {\frac{A_{13} - \delta_{HV} - \sigma}{{{A_{13} - \delta_{HV}}} + \sigma} + 1} \right\rbrack.}}} & \left\lbrack {{Equation}\mspace{14mu} 32} \right\rbrack \end{matrix}$

In an example, for the fourth orientation sector Q₄, determining relative position information may be expressed as shown in the following table:

TABLE 32 Lateral Position Q₄ RV in lane (I_(Q) ₄ ) RV Left (L_(Q) ₄ ) RV Right (R_(Q) ₄ ) Longitudinal RV Ahead (P_(Q) ₄ ) Q ₄ × P_(Q) ₄ × I_(Q) ₄ Q ₄ × P_(Q) ₄ × L_(Q) ₄ Q ₄ × P_(Q) ₄ × R_(Q) ₄ Position RV Adjacent (A_(Q) ₄ ) Q ₄ × A_(Q) ₄ × I_(Q) ₄ Q ₄ × A_(Q) ₄ × L_(Q) ₄ Q ₄ × A_(Q) ₄ × R_(Q) ₄ RV Behind (B_(Q) ₄ ) Q ₄ × B_(Q) ₄ × I_(Q) ₄ Q ₄ × B_(Q) ₄ × L_(Q) ₄ Q ₄ × B_(Q) ₄ × R_(Q) ₄

In some embodiments, the relative position information for the remote vehicle relative to the host vehicle may be expressed as a codeword, or partial codeword, such as a codeword, or partial codeword, including four bits (X, W, V, U), as shown in Table 33 below.

TABLE 33 VU 00 01 10 11 XW 00 0000 0001 0010 0011 01 0100 0101 0110 0111 10 1000 1001 1010 1011 11 1100 1101 1110 1111

In some embodiments, generating the codeword, or partial codeword, representing the longitudinal and lateral position of the remote vehicle relative to the host vehicle, such as the four bits (X, W, V, U), may be expressed as shown in the following table.

TABLE 34 x w v u x₁ = 0 w₁ = 0 v₁ = 0 u₁ = 0 x₂ = 0 w₂ = 0 v₂ = 0 u₂ = Σ_(i=1) ⁴ Q_(i) × P_(Q) _(i) × L_(Q) _(i) × 1 x₃ = 0 w₃ = 0 v₃ = Σ_(i=1) ⁴ Q_(i) × P_(Q) _(i) × u₃ = 0 R_(Q) _(i) × 1 x₄ = 0 w₄ = Σ_(i=1) ⁴ Q_(i) × A_(Q) _(i) × v₅ = 0 u₅ = Σ_(i=1) ⁴ Q_(i) × A_(Q) _(i) × I_(Q) _(i) × 1 L_(Q) _(i) × 1 x₅ = 0 w₅ = Σ_(i=1) ⁴ Q_(i) × A_(Q) _(i) × v₁ = 0 u₁ = 0 L_(Q) _(i) × 1 x₆ = 0 w₆ = Σ_(i=1) ⁴ Q_(i) × A_(Q) _(i) × v₆ = Σ_(i=1) ⁴ Q_(i) × A_(Q) _(i) × u₆ = 0 R_(Q) _(i) × 1 R_(Q) _(i) × 1 x₇ = Σ_(i=1) ⁴ Q_(i) × B_(Q) _(i) × w₇ = 0 v₇ = 0 u₇ = 0 I_(Q) _(i) × 1 x₈ = Σ_(i=1) ⁴ Q_(i) × B_(Q) _(i) × w₈ = 0 v₈ = 0 u₈ = Σ_(i=1) ⁴ Q_(i) × B_(Q) _(i) × L_(Q) _(i) × 1 L_(Q) _(i) × 1 x₉ = Σ_(i=1) ⁴ Q_(i) × B_(Q) _(i) × w₉ = 0 v₉ = Σ_(i=1) ⁴ Q_(i) × B_(Q) _(i) × u₉ = 0 R_(Q) _(i) × 1 R_(Q) _(i) × 1 X = Σ_(i=1) ⁹ x_(i) W = Σ_(i=1) ⁹ w_(i) V = Σ_(i=1) ⁹ v_(i) U = Σ_(i=1) ⁹ u_(i)

In some embodiments, determining the host vehicle approach angle α_(HV), the remote vehicle approach angle α_(RV), and the intersection angle α_(D) for any combination of orientation sector, host vehicle region, and remote vehicle region may be expressed as the in Equations 33-39:

$\begin{matrix} {Q_{1} = {{\frac{1}{4}\left\lbrack {\frac{\varphi_{RV} - \varphi_{HV} - \sigma}{{{\varphi_{RV} - \varphi_{HV}}} + \sigma} + 1} \right\rbrack} \times {\left\lbrack {\frac{\theta_{RV} - \theta_{HV} - \sigma}{{{\theta_{RV} - \theta_{HV}}} + \sigma} + 1} \right\rbrack.}}} & \left\lbrack {{Equation}\mspace{14mu} 33} \right\rbrack \\ {Q_{2} = {{\frac{1}{4}\left\lbrack {\frac{\varphi_{HV} - \varphi_{RV} - \sigma}{{{\varphi_{RV} - \varphi_{HV}}} + \sigma} + 1} \right\rbrack} \times {\left\lbrack {\frac{\theta_{RV} - \theta_{HV} - \sigma}{{{\theta_{RV} - \theta_{HV}}} + \sigma} + 1} \right\rbrack.}}} & \left\lbrack {{Equation}\mspace{14mu} 34} \right\rbrack \\ {Q_{3} = {{\frac{1}{4}\left\lbrack {\frac{\varphi_{HV} - \varphi_{RV} - \sigma}{{{\varphi_{RV} - \varphi_{HV}}} + \sigma} + 1} \right\rbrack} \times {\left\lbrack {\frac{\theta_{HV} - \theta_{RV} - \sigma}{{{\theta_{RV} - \theta_{HV}}} + \sigma} + 1} \right\rbrack.}}} & \left\lbrack {{Equation}\mspace{14mu} 35} \right\rbrack \\ {Q_{4} = {{\frac{1}{4}\left\lbrack {\frac{\varphi_{RV} - \varphi_{HV} - \sigma}{{{\varphi_{RV} - \varphi_{HV}}} + \sigma} + 1} \right\rbrack} \times {\left\lbrack {\frac{\theta_{HV} - \theta_{RV} - \sigma}{{{\theta_{RV} - \theta_{HV}}} + \sigma} + 1} \right\rbrack.}}} & \left\lbrack {{Equation}\mspace{14mu} 36} \right\rbrack \\ {\alpha_{HV} = {{Q_{1}{\sum\limits_{m = 1}^{6}{\sum\limits_{n = 1}^{6}{F\; {\eta\alpha}_{HV}}}}} + {Q_{2}{\sum\limits_{m = 1}^{6}{\sum\limits_{n = 1}^{6}{F\; {\eta\alpha}_{HV}}}}} + {Q_{3}{\sum\limits_{m = 1}^{6}{\sum\limits_{n = 1}^{6}{F\; {\eta\alpha}_{HV}}}}} + {Q_{4}{\sum\limits_{m = 1}^{6}{\sum\limits_{n = 1}^{6}{F\; {{\eta\alpha}_{HV}.}}}}}}} & \left\lbrack {{Equation}\mspace{14mu} 37} \right\rbrack \\ {\alpha_{RV} = {{Q_{1}{\sum\limits_{m = 1}^{6}{\sum\limits_{n = 1}^{6}{F\; {\eta\alpha}_{RV}}}}} + {Q_{2}{\sum\limits_{m = 1}^{6}{\sum\limits_{n = 1}^{6}{F\; {\eta\alpha}_{RV}}}}} + {Q_{3}{\sum\limits_{m = 1}^{6}{\sum\limits_{n = 1}^{6}{F\; {\eta\alpha}_{RV}}}}} + {Q_{4}{\sum\limits_{m = 1}^{6}{\sum\limits_{n = 1}^{6}{F\; {{\eta\alpha}_{RV}.}}}}}}} & \left\lbrack {{Equation}\mspace{14mu} 38} \right\rbrack \\ {\alpha_{D} = {{Q_{1}{\sum\limits_{m = 1}^{6}{\sum\limits_{n = 1}^{6}{F\; {\eta\alpha}_{D}}}}} + {Q_{2}{\sum\limits_{m = 1}^{6}{\sum\limits_{n = 1}^{6}{F\; {\eta\alpha}_{D}}}}} + {Q_{3}{\sum\limits_{m = 1}^{6}{\sum\limits_{n = 1}^{6}{F\; {\eta\alpha}_{D}}}}} + {Q_{4}{\sum\limits_{m = 1}^{6}{\sum\limits_{n = 1}^{6}{F\; {{\eta\alpha}_{D}.}}}}}}} & \left\lbrack {{Equation}\mspace{14mu} 39} \right\rbrack \end{matrix}$

For simplicity and clarity, some notation has been omitted from Equations 33-39. For example, the portion Fηα_(HV) at the right hand side of Equation 37 may be more expansively recited as follows:

F ₄ _(m,n) η₄ _(m,n) α_(HV4) _(m,n) .

In some embodiments, the distance from the host vehicle to the intersection (l_(HV)) may be determined as shown in the following:

$\begin{matrix} {{{\frac{D}{\sin \; \alpha_{D}} = {\frac{l_{HV}}{\sin \; \alpha_{RV}} = \frac{l_{RV}}{\sin \; \alpha_{HV}}}};}{l_{HV} = {D{\frac{\sin \; \alpha_{RV}}{\sin \; \alpha_{D}}.}}}} & \left\lbrack {{Equation}\mspace{14mu} 40} \right\rbrack \end{matrix}$

FIG. 21 is a diagram of identifying inter-vehicle state information including relative elevation information for use in generating converging path information in accordance with this disclosure. Identifying inter-vehicle state information may be implemented in a vehicle, such as the vehicle 1000 shown in FIG. 1 or the vehicles 2100/2110 shown in FIG. 2.

In some embodiments, generating converging path information may include determining relative elevation information for the host vehicle (HV), the remote vehicle (RV), or both. In some embodiments, z_(HV) may indicate the host vehicle elevation, z_(RV) may indicate the remote vehicle elevation, £ may indicate a spatial distance offset threshold, such as four meters, and the relative elevation information for the host vehicle and the remote vehicle may indicate that the host vehicle and the remote vehicle are at equivalent elevations, or level, (TS=00), which may be expressed as shown in Equation 41, the relative elevation information for the host vehicle and the remote vehicle may indicate that the host vehicle is at a lower elevation than the remote vehicle (TS=01), which may be expressed as shown in Equation 42, or the relative elevation information for the host vehicle and the remote vehicle may indicate that the host vehicle is at a higher elevation than the remote vehicle (TS=10), which may be expressed as shown in Equation 43, as follows:

$\begin{matrix} {Z_{1} = {{{\frac{1}{4}\left\lbrack \frac{ɛ - \left( {z_{HV} - z_{RV}} \right) + \sigma}{{{ɛ - \left( {z_{HV} - z_{RV}} \right)}} + \sigma} \right\rbrack} \times \left\lbrack \frac{ɛ - \left( {z_{RV} - z_{HV}} \right) - \sigma}{{{ɛ - \left( {z_{RV} - z_{HV}} \right)}} + \sigma} \right\rbrack} = 1.}} & {\left\lbrack {{Equation}\mspace{11mu} 41} \right\rbrack \;} \\ {\mspace{79mu} {Z_{2} = {{\frac{1}{2}\left\lbrack \frac{\left( {z_{RV} - z_{HV}} \right) - ɛ - \sigma}{{{\left( {z_{RV} - z_{HV}} \right) - ɛ}} + \sigma} \right\rbrack} = 1.}}} & \left\lbrack {{Equation}\mspace{14mu} 42} \right\rbrack \\ {\mspace{79mu} {Z_{3} = {{\frac{1}{2}\left\lbrack \frac{\left( {z_{HV} - z_{RV}} \right) - ɛ - \sigma}{{{\left( {z_{HV} - z_{RV}} \right) - ɛ}} + \sigma} \right\rbrack} = 1.}}} & \left\lbrack {{Equation}\mspace{14mu} 43} \right\rbrack \end{matrix}$

In some embodiments, the relative elevation information for the remote vehicle and the host vehicle may be expressed as a codeword, or partial codeword, such as a codeword, or partial codeword, including two bits (T, S), as shown in Table 35 below.

TABLE 35 t s t₁ = Z₁ × 0 s₁ = Z₁ × 0 t₂ = Z₂ × 0 s₂ = Z₂ × 1 t₃ = Z₃ × 1 s₃ = Z₃ × 0 T = Σ_(i=1) ³ t_(i) S = Σ_(i=1) ³ s_(i)

In some embodiments, generating converging path information may include determining relative heading information, such as heading information for a remote vehicle relative to the host vehicle (RQ), which may include determining a remote vehicle heading angle as a function of the host vehicle heading angle. For example, a remote vehicle may be following behind the host vehicle and traveling in the same direction and the remote vehicle heading angle may be equivalent to the host vehicle heading angle (δ_(RV)=δ_(HV)).

In some embodiments, determining relative heading information may include using an approximation of a remote vehicle heading. For example, a heading approximation offset threshold φ_(A), which may be an angular offset threshold, may indicate a defined range of heading angles, such as a ten degree range of heading angles (φ_(A)=5), in which the remote vehicle heading may be determined to be aligned with the host vehicle heading. In some embodiments, approximate remote vehicle headings within the defined range of heading angles, centered on the remote vehicle heading, that are equivalent to the host vehicle heading, may be identified, and a remote vehicle heading may be determined using the approximate remote vehicle headings.

In some embodiments, relative heading information (RQ) may indicate that a remote vehicle heading and the host vehicle heading are directionally aligned (RQ=01), the remote vehicle heading and the host vehicle heading are directionally opposed (RQ=10), the remote vehicle heading and the host vehicle heading are directionally perpendicular (RQ=11), or the remote vehicle heading and the host vehicle heading are divergent (RQ=00).

FIG. 22 is a diagram of determining relative heading information for directionally aligned vehicles in accordance with this disclosure. In some embodiments, determining relative heading information may include identifying a minimum approximate remote vehicle heading angle δ_(RV) _(min) ⁰¹. For example, the remote vehicle heading angle may be less than the heading approximation offset φ_(A), which may be expressed as δ_(RV)−φ_(A)<0, and determining the minimum approximate remote vehicle heading angle may be expressed as follows:

δ_(RV) _(min) ⁰¹=2π+δ_(RV)−φ_(A).  [Equation 44]

In another example, the remote vehicle heading angle may be at least the heading approximation offset threshold φ_(A), which may be expressed as δ_(RV)−φ_(A)>0, and determining the minimum approximate remote vehicle heading angle may be expressed as follows:

δ_(RV) _(min) ⁰¹=δ_(RV)−φ_(A).  [Equation 45]

In some embodiments, evaluating whether the remote vehicle heading angle is within the heading approximation range, as expressed in Equations 44 and 45, may be expressed in combination as shown in Equation 46-48, as follows:

$\begin{matrix} {\mspace{79mu} {\varsigma_{\min_{1}} = {{\frac{1}{2}\left\lbrack {\frac{0 - \left( {\delta_{RV} - \phi_{A}} \right) - \sigma}{{{0 - \left( {\delta_{RV} - \phi_{A}} \right)}} + \sigma} + 1} \right\rbrack}.}}} & \left\lbrack {{Equation}\mspace{14mu} 46} \right\rbrack \\ {\mspace{79mu} {\varsigma_{\min_{2}} = {{\frac{1}{2}\left\lbrack {\frac{\left( {\delta_{RV} - \phi_{A}} \right) - 0 + \sigma}{{{\left( {\delta_{RV} - \phi_{A}} \right) - 0}} + \sigma} + 1} \right\rbrack}.}}} & \left\lbrack {{Equation}\mspace{14mu} 47} \right\rbrack \\ {\delta_{{RV}_{\min}}^{01} = {{\varsigma_{\min_{1}} \times \left( {{2\pi} + \delta_{RV} - \phi_{A}} \right)} + {\varsigma_{\min_{2}} \times {\left( {\delta_{RV} - \phi_{A}} \right).}}}} & \left\lbrack {{Equation}\mspace{14mu} 48} \right\rbrack \end{matrix}$

In some embodiments, determining relative heading information may include identifying a maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹. For example, a sum of the remote vehicle heading angle δ_(RV) and the heading approximation offset φ_(A) may be less than 2π, which may be expressed as δ_(RV)+φ_(A)<2π, and determining the maximum approximate remote vehicle heading angle may be expressed as follows:

δ_(RV) _(max) ⁰¹=δ_(RV)+φ_(A).  [Equation 49]

In another example, the sum of the remote vehicle heading angle δ_(RV) and the heading approximation offset φ_(A) may be at least 2π, which may be expressed as δ_(RV)+φ_(A)>=2π, and determining the maximum approximate remote vehicle heading angle may be expressed as follows:

δ_(RV) _(max) ⁰¹=δ_(RV)+φ_(A).  [Equation 50]

In some embodiments, evaluating whether the remote vehicle heading angle is within the heading approximation range, as expressed in Equations 49 and 50, may be expressed in combination as shown in Equation 51-53, as follows:

$\begin{matrix} {\mspace{79mu} {\varsigma_{\max_{1}} = {{\frac{1}{2}\left\lbrack {\frac{{2\pi} - \left( {\delta_{RV} + \phi_{A}} \right) - \sigma}{{{{2\pi} - \left( {\delta_{RV} + \phi_{A}} \right)}} + \sigma} + 1} \right\rbrack}.}}} & \left\lbrack {{Equation}\mspace{14mu} 51} \right\rbrack \\ {\mspace{79mu} {\varsigma_{\max_{2}} = {{\frac{1}{2}\left\lbrack {\frac{\left( {\delta_{RV} + \phi_{A}} \right) - {2\pi} + \sigma}{{{\left( {\delta_{RV} + \phi_{A}} \right) - {2\pi}}} + \sigma} + 1} \right\rbrack}.}}} & \left\lbrack {{Equation}\mspace{14mu} 52} \right\rbrack \\ {\delta_{{RV}_{\max}}^{01} = {{\varsigma_{\max_{1}} \times \left( {\delta_{RV} + \phi_{A}} \right)} + {\varsigma_{\max_{2}} \times {\left( {\delta_{RV} + \phi_{A} - {2\pi}} \right).}}}} & \left\lbrack {{Equation}\mspace{14mu} 53} \right\rbrack \end{matrix}$

In some embodiments, the host vehicle heading angle δ_(HV) may be within the range from the minimum approximate remote vehicle heading angle δ_(RV) _(min) ⁰¹ to the maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹ and the remote vehicle heading angle may be determined to be directionally aligned with the host vehicle heading angle, which may be expressed as δ_(RV) _(min) ⁰¹≦δ_(HV)<δ_(RV) _(max) ⁰¹.

FIG. 23 is a diagram of determining relative heading information with divergent paths in accordance with this disclosure. In some embodiments, the host vehicle heading angle δ_(HV) may be outside the range from the minimum approximate remote vehicle heading angle δ_(RV) _(min) ⁰¹ to the maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹ and the remote vehicle expected path may be determined to be divergent with the host vehicle expected path, which may be expressed as δ_(RV) _(min) ⁰¹<δ_(RV) _(max) ⁰¹<δ_(HV) (as shown) or δ_(HV)<δ_(RV) _(min) ⁰¹<δ_(RV) _(max) ⁰¹ (not expressly shown).

FIGS. 24 and 25 are diagrams of determining relative heading information wherein a difference between the remote vehicle heading angle and the reference direction is within a threshold in accordance with this disclosure. As shown in FIG. 24, the remote vehicle heading angle δ_(RV) may be less than heading approximation offset threshold φ_(A), the maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹ may be greater than the remote vehicle heading angle δ_(RV) and the minimum approximate remote vehicle heading angle δ_(RV) _(min) ⁰¹ may be greater than the maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹. As shown in FIG. 25, a sum of the remote vehicle heading angle δ_(RV) and the heading approximation offset φ_(A) may be less than 2π, the maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹ may be less than the remote vehicle heading angle δ_(RV), and the minimum approximate remote vehicle heading angle δ_(RV) _(min) ⁰¹ may be greater than the maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹.

In some embodiments, the host vehicle heading angle δ_(RV) may be outside the range from the minimum approximate remote vehicle heading angle δ_(RV) _(min) ⁰¹ to the maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹ and the remote vehicle expected path may be determined to be divergent with the host vehicle expected path. For example, the host vehicle heading angle δ_(RV) may be less than the maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹ and may be less than the minimum approximate remote vehicle heading angle δ_(RV) _(min) ⁰¹ (as shown), which may be expressed as δ_(RV) _(min) ⁰¹<δ_(RV) _(max) ⁰¹<δ_(HV), or the host vehicle heading angle δ_(HV) may be greater than the maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹ and may be greater than the minimum approximate remote vehicle heading angle δ_(RV) _(min) ⁰¹ (not shown), which may be expressed as δ_(HV)<δ_(RV) _(min) ⁰¹<δ_(RV) _(max) ⁰¹, and a false negative incorrectly indicating that the expected path for the remote vehicle and the expected path for the host vehicle are divergent may be identified. In some embodiments, generating converging path information may include using a stabilization function such that the false negative is correctly identified as convergent. For example, generating converging path information may include generating a codeword indicating whether the remote vehicle expected path and the host vehicle expected path are convergent, and generating converging path information using the stabilization function may include generating a stabilized codeword.

In some embodiments, determining relative heading information using a stabilization function may include determining a minimum stabilization metric H₁ a maximum stabilization metric H₂, or both. The host vehicle heading angle δ_(RV) may be at least zero and may be less than 2π, the remote vehicle heading angle δ_(RV) may be at least zero and may be less than 2π, the minimum approximate remote vehicle heading angle δ_(RV) _(min) ⁰¹ may be at least zero and may be less than 2π, the maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹ may be at least zero and may be less than 2π, the minimum stabilization metric H₁ may be greater than zero (positive) or less than zero (negative), and the maximum stabilization metric H₂ may be greater than zero (positive) or less than zero (negative).

In some embodiments, determining relative heading information using a stabilization function may include determining a minimum stabilization metric H₁ by subtracting the minimum approximate remote vehicle heading angle δ_(RV) _(min) ⁰¹ from the host vehicle heading angle δ_(RV), which may be expressed as H₁=δ_(HV)−δ_(RV) _(min) ⁰¹, determining a maximum stabilization metric H₂ by subtracting the maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹ from the host vehicle heading angle δ_(RV), which may be expressed as H₂=δ_(RV)−δ_(RV) _(max) ⁰¹, or generating the minimum stabilization metric and the maximum stabilization metric.

In some embodiments, the host vehicle heading angle δ_(RV) may be less than the minimum approximate remote vehicle heading angle δ_(RV) _(min) ⁰¹, the host vehicle heading angle δ_(RV) may be less than the maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹, the minimum stabilization metric H₁ may be a negative value, the maximum stabilization metric H₂ may be a negative value, and the minimum stabilization metric H₁ may be less than the maximum stabilization metric H₂.

In some embodiments, the host vehicle heading angle δ_(RV) may be greater than the minimum approximate remote vehicle heading angle δ_(RV) _(min) ⁰¹, the host vehicle heading angle δ_(RV) may be less than the maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹, the minimum stabilization metric H₁ may be a positive value, the maximum stabilization metric H₂ may be a negative value, and the minimum stabilization metric H₁ may be greater than the maximum stabilization metric H₂.

In some embodiments, the host vehicle heading angle δ_(RV) may be greater than the minimum approximate remote vehicle heading angle δ_(RV) _(min) ⁰¹, the host vehicle heading angle δ_(RV) may be greater than the maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹, the minimum stabilization metric H₁ may be a positive value, the maximum stabilization metric H₂ may be a positive value, and the minimum stabilization metric H₁ may be less than the maximum stabilization metric H₂.

In some embodiments, a first partial stabilization function Δ₁ ⁰¹ may be expressed as the following:

$\begin{matrix} {\Delta_{1}^{01} = {{\frac{1}{8}\left\lbrack {\frac{\delta_{{RV}_{\min}}^{01} - \delta_{RV} + \sigma}{{{\delta_{{RV}_{\min}}^{01} - \delta_{RV}}} + \sigma} + 1} \right\rbrack} \times {\quad{\left\lbrack {\frac{\delta_{{RV}_{\max}}^{01} - \delta_{RV} + \sigma}{{{\delta_{{RV}_{\max}}^{01} - \delta_{RV}}} + \sigma} + 1} \right\rbrack \times {\left\lbrack {1 - \frac{H_{1} - H_{2} - \sigma}{{{H_{1} - H_{2}}} + \sigma}} \right\rbrack.}}}}} & \left\lbrack {{Equation}\mspace{14mu} 54} \right\rbrack \end{matrix}$

In some embodiments, the minimum stabilization metric H₁ may be less than the maximum stabilization metric H₂, the remote vehicle heading angle δ_(RV) may be within the minimum approximate remote vehicle heading angle δ_(RV) _(min) ⁰¹, the remote vehicle heading angle δ_(RV) may be within the maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹ and the first partial stabilization function Δ₁ ⁰¹ may evaluate to one. In some embodiments, the minimum stabilization metric H₁ may be at least the maximum stabilization metric H₂, the remote vehicle heading angle δ_(RV) may exceed the minimum approximate remote vehicle heading angle δ_(RV) _(min) ⁰¹, or the remote vehicle heading angle δ_(RV) may exceed the maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹, and the first partial stabilization function Δ₁ ⁰¹ may evaluate to zero.

In some embodiments, a second partial stabilization function Δ₂ ⁰¹ may be expressed as the following:

$\begin{matrix} {\Delta_{2}^{01} = {{\frac{1}{8}\left\lbrack {\frac{\delta_{RV} - \delta_{{RV}_{\min}}^{01} + \sigma}{{{\delta_{RV} - \delta_{{RV}_{\min}}^{01}}} + \sigma} + 1} \right\rbrack} \times {\quad{\left\lbrack {\frac{\delta_{{RV}_{\max}}^{01} - \delta_{RV} + \sigma}{{{\delta_{{RV}_{\max}}^{01} - \delta_{RV}}} + \sigma} + 1} \right\rbrack \times {\left\lbrack {\frac{H_{1} - H_{2} - \sigma}{{{H_{1} - H_{2}}} + \sigma} + 1} \right\rbrack.}}}}} & \left\lbrack {{Equation}\mspace{14mu} 55} \right\rbrack \end{matrix}$

In some embodiments, the minimum stabilization metric H₁ may be greater than the maximum stabilization metric H₂, the minimum approximate remote vehicle heading angle δ_(RV) _(min) ¹⁰ may be within the remote vehicle heading angle δ_(RV), the remote vehicle heading angle δ_(RV) may be within the maximum approximate remote vehicle heading angle δ_(RV) _(min) ⁰¹, and the second partial stabilization function Δ₂ ⁰¹ may evaluate to one. In some embodiments, the minimum stabilization metric H₁ may be at least the maximum stabilization metric H₂, the minimum approximate remote vehicle heading angle δ_(RV) _(min) ⁰¹ may exceed the remote vehicle heading angle δ_(RV), or the remote vehicle heading angle δ_(RV) may exceed the maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹, and the second partial stabilization function Δ₂ ⁰¹ may evaluate to zero.

In some embodiments, a third partial stabilization function Δ₃ ⁰¹ may be expressed as the following:

$\begin{matrix} {\Delta_{3}^{01} = {{\frac{1}{8}\left\lbrack {\frac{\delta_{RV} - \delta_{{RV}_{\min}}^{01} + \sigma}{{{\delta_{RV} - \delta_{{RV}_{\min}}^{01}}} + \sigma} + 1} \right\rbrack} \times {\quad{\left\lbrack {\frac{\delta_{RV} - \delta_{{RV}_{\max}}^{01} + \sigma}{{{\delta_{RV} - \delta_{{RV}_{\max}}^{01}}} + \sigma} + 1} \right\rbrack \times {\left\lbrack {1 - \frac{H_{1} - H_{2} - \sigma}{{{H_{1} - H_{2}}} + \sigma}} \right\rbrack.}}}}} & \left\lbrack {{Equation}\mspace{14mu} 56} \right\rbrack \end{matrix}$

In some embodiments, the minimum stabilization metric H₁ may be less than the maximum stabilization metric H₂, the minimum approximate remote vehicle heading angle δ_(RV) _(min) ⁰¹ may be within the remote vehicle heading angle δ_(RV), the maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹ may be within the remote vehicle heading angle δ_(RV), and the third partial stabilization function Δ₁ ⁰¹ may evaluate to one. In some embodiments, the minimum stabilization metric H₁ may be at least the maximum stabilization metric H₂, the minimum approximate remote vehicle heading angle δ_(RV) _(min) ⁰¹ may exceed the remote vehicle heading angle δ_(RV), or the maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹ may exceed the remote vehicle heading angle δ_(RV), and the third partial stabilization function Δ₃ ⁰¹ may evaluate to zero.

In some embodiments, the difference between the minimum stabilization metric H₁ and the maximum stabilization metric H₂ may be expressed as the following:

H ₁ −H ₂=δ_(HV)−δ_(RV) _(min) ⁰¹−(δ_(HV)−δ_(RV) _(max) ⁰¹),

H ₁ −H ₂=δ_(HV)−δ_(RV) _(min) ⁰¹−δ_(HV)+δ_(RV) _(max) ⁰¹,

H ₁ −H ₂=δ_(RV) _(max) ⁰¹−δ_(HV)−δ_(RV) _(min) ⁰¹  [Equation 57]

In some embodiments, the first partial stabilization function Δ₁ ⁰¹ may be expressed as the following:

$\begin{matrix} {\Delta_{1}^{01} = {{\frac{1}{8}\left\lbrack {\frac{\delta_{{RV}_{\min}}^{01} - \delta_{RV} + \sigma}{{{\delta_{{RV}_{\min}}^{01} - \delta_{RV}}} + \sigma} + 1} \right\rbrack} \times {\quad{\left\lbrack {\frac{\delta_{{RV}_{\max}}^{01} - \delta_{RV} + \sigma}{{{\delta_{{RV}_{\max}}^{01} - \delta_{RV}}} + \sigma} + 1} \right\rbrack \times {\quad{\left\lbrack {1 - \frac{\delta_{{RV}_{\max}}^{01} - \delta_{{RV}_{\min}}^{01} - \sigma}{{{\delta_{{RV}_{\max}}^{01} - \delta_{{RV}_{\min}}^{01}}} + \sigma}} \right\rbrack.}}}}}} & \left\lbrack {{Equation}\mspace{14mu} 58} \right\rbrack \end{matrix}$

In some embodiments, the second partial stabilization function Δ₂ ⁰¹ may be expressed as the following:

$\begin{matrix} {\Delta_{2}^{01} = {{\frac{1}{8}\left\lbrack {\frac{\delta_{RV} - \delta_{{RV}_{\min}}^{01} + \sigma}{{{\delta_{RV} - \delta_{{RV}_{\min}}^{01}}} + \sigma} + 1} \right\rbrack} \times {\quad{\left\lbrack {\frac{\delta_{{RV}_{\max}}^{01} - \delta_{RV} + \sigma}{{{\delta_{{RV}_{\max}}^{01} - \delta_{RV}}} + \sigma} + 1} \right\rbrack \times {\quad{\left\lbrack {\frac{\delta_{{RV}_{\max}}^{01} - \delta_{{RV}_{\min}}^{01} - \sigma}{{{\delta_{{RV}_{\max}}^{01} - \delta_{{RV}_{\min}}^{01}}} + \sigma} + 1} \right\rbrack.}}}}}} & \left\lbrack {{Equation}\mspace{14mu} 59} \right\rbrack \end{matrix}$

In some embodiments, the third partial stabilization Δ₃ ⁰¹ may be expressed as the following:

$\begin{matrix} {\Delta_{3}^{01} = {{\frac{1}{8}\left\lbrack {\frac{\delta_{RV} - \delta_{{RV}_{\min}}^{01} + \sigma}{{{\delta_{RV} - \delta_{{RV}_{\min}}^{01}}} + \sigma} + 1} \right\rbrack} \times {\quad{\left\lbrack {\frac{\delta_{RV} - \delta_{{RV}_{\max}}^{01} + \sigma}{{{\delta_{RV} - \delta_{{RV}_{\max}}^{01}}} + \sigma} + 1} \right\rbrack \times {\quad{\left\lbrack {1 - \frac{\delta_{{RV}_{\max}}^{01} - \delta_{{RV}_{\min}}^{01} - \sigma}{{{\delta_{{RV}_{\max}}^{01} - \delta_{{RV}_{\min}}^{01}}} + \sigma}} \right\rbrack.}}}}}} & \left\lbrack {{Equation}\mspace{14mu} 60} \right\rbrack \end{matrix}$

In some embodiments, the sum of the first partial stabilization function Δ₁ ⁰¹, the second partial stabilization function Δ₂ ⁰¹, and the third partial stabilization Δ₃ ⁰¹ may be one and the remote vehicle and the host vehicle may be determined to be traveling in the same direction (RQ=01), which may be expressed as the following:

$\begin{matrix} {{{{\sum\limits_{i = 1}^{3}\Delta_{i}^{01}} = 1};}{{r_{1} = {\sum\limits_{i = 1}^{3}{\Delta_{i}^{01} \times 0}}},{q_{1} = {\sum\limits_{i = 1}^{3}{\Delta_{i}^{01} \times 1.}}}}} & \left\lbrack {{Equation}\mspace{14mu} 61} \right\rbrack \end{matrix}$

FIG. 26 is a diagram of determining relative heading information for directionally opposed vehicles in accordance with this disclosure. In some embodiments, determining relative heading information may include determining relative heading information wherein the remote vehicle heading and the host vehicle heading are directionally opposed (RQ=10). For example, a remote vehicle may be in front of the host vehicle and traveling in the opposite direction and the remote vehicle heading angle may be equivalent to the host vehicle heading angle, which may be expressed as the following:

$\begin{matrix} {\delta_{RV} = {{{\frac{1}{2}\left\lbrack {\frac{\delta_{HW} - \pi - \sigma}{{{\delta_{HV} - \pi}} + \sigma} + 1} \right\rbrack} \times \left( {\delta_{HV} - \pi} \right)} + {{\frac{1}{2}\left\lbrack {\frac{\pi - \delta_{HW} - \sigma}{{{\pi - \delta_{HV}}} + \sigma} + 1} \right\rbrack} \times {\left( {\delta_{HV} + \pi} \right).}}}} & \left\lbrack {{Equation}\mspace{14mu} 62} \right\rbrack \end{matrix}$

In some embodiments, determining relative heading information wherein the remote vehicle heading and the host vehicle heading are directionally opposed may include identifying a minimum approximate remote vehicle heading angle δ_(RV) _(min) ⁰¹. In some embodiments, a heading approximation offset threshold φ_(C), which may be an angular offset threshold, may indicate a defined range of heading angles, such as a ten degree range of heading angles (φ_(C)=5), in which the remote vehicle heading may be determined to be opposite to the host vehicle heading. For example, the remote vehicle heading angle may be less than a heading approximation offset φ_(C), which may be expressed as δ_(RV)−φ_(C)<0, and determining the minimum approximate remote vehicle heading angle may be expressed as follows:

δ_(RV) _(min) ⁰¹=2π+δ_(RV)−φ_(C).  [Equation 63]

In another example, the remote vehicle heading angle may be at least the heading approximation offset threshold φ_(C), which may be expressed as δ_(RV)−φ_(C)>=0, and determining the minimum approximate remote vehicle heading angle may be expressed as follows:

δ_(RV) _(min) ⁰¹=δ_(RV)−φ_(C).  [Equation 64]

In some embodiments, evaluating whether the remote vehicle heading angle is within the heading approximation range, as expressed in Equations 63 and 64, may be expressed in combination as shown in Equation 65-67, as follows:

$\begin{matrix} {\mspace{79mu} {\varsigma_{\min_{1}} = {{\frac{1}{2}\left\lbrack {\frac{0 - \left( {\delta_{RV} - \phi_{C}} \right) - \sigma}{{{0 - \left( {\delta_{RV} - \phi_{C}} \right)}} + \sigma} + 1} \right\rbrack}.}}} & \left\lbrack {{Equation}\mspace{14mu} 65} \right\rbrack \\ {\mspace{85mu} {\varsigma_{\min_{2}} = {{\frac{1}{2}\left\lbrack {\frac{\left( {\delta_{RV} - \phi_{C}} \right) - 0 + \sigma}{{{\left( {\delta_{RV} - \phi_{C}} \right) - 0}} + \sigma} + 1} \right\rbrack}.}}} & \left\lbrack {{Equation}\mspace{14mu} 66} \right\rbrack \\ {\delta_{{RV}_{\min}}^{10} = {{\varsigma_{\min_{1}} \times \left( {{2\pi} + \delta_{RV} - \phi_{C}} \right)} + {\varsigma_{\min_{2}} \times {\left( {\delta_{RV} - \phi_{C}} \right).}}}} & \left\lbrack {{Equation}\mspace{14mu} 67} \right\rbrack \end{matrix}$

In some embodiments, determining relative heading information wherein the remote vehicle heading and the host vehicle heading are directionally opposed may include identifying a maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹. For example, a sum of the remote vehicle heading angle δ_(RV) and the heading approximation offset φ_(C) may be less than 2π, which may be expressed as δ_(RV)+φ_(C)<2π, and determining the maximum approximate remote vehicle heading angle may be expressed as follows:

δ_(RV) _(max) ⁰¹=δ_(RV)+φ_(C).  [Equation 68]

In another example, the sum of the remote vehicle heading angle δ_(RV) and the heading approximation offset φ_(C) may be at least 2π, which may be expressed as δ_(RV)+φ_(C)>=2π, and determining the maximum approximate remote vehicle heading angle may be expressed as follows:

δ_(RV) _(max) ⁰¹=δ_(RV)+φ_(C)−2π.  [Equation 69]

In some embodiments, evaluating whether the remote vehicle heading angle is within the heading approximation range, as expressed in Equations 68 and 69, may be expressed in combination as shown in Equation 70-72, as follows:

$\begin{matrix} {\mspace{79mu} {\varsigma_{\max_{1}} = {{\frac{1}{2}\left\lbrack {\frac{{2\pi} - \left( {\delta_{RV} + \phi_{C}} \right) - \sigma}{{{{2\pi} - \left( {\delta_{RV} + \phi_{C}} \right)}} + \sigma} + 1} \right\rbrack}.}}} & \left\lbrack {{Equation}\mspace{14mu} 70} \right\rbrack \\ {\mspace{79mu} {\varsigma_{\max_{2}} = {{\frac{1}{2}\left\lbrack {\frac{\left( {\delta_{RV} + \phi_{C}} \right) - {2\pi} + \sigma}{{{\left( {\delta_{RV} + \phi_{C}} \right) - {2\pi}}} + \sigma} + 1} \right\rbrack}.}}} & \left\lbrack {{Equation}\mspace{14mu} 71} \right\rbrack \\ {\delta_{{RV}_{\max}}^{10} = {{\varsigma_{\max_{1}} \times \left( {\delta_{RV} + \phi_{C}} \right)} + {\varsigma_{\max_{2}} \times {\left( {\delta_{RV} + \phi_{C} - {2\pi}} \right).}}}} & \left\lbrack {{Equation}\mspace{14mu} 72} \right\rbrack \end{matrix}$

As shown in FIG. 26, the host vehicle angle δ_(HV) may be greater than π, greater than the minimum approximate remote vehicle heading angle δ_(RV) _(min) ⁰¹, greater than the maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹, and the remote vehicle heading and the host vehicle heading may be directionally opposed (RQ=10). Although not shown expressly in FIG. 26, in some embodiments, the host vehicle angle δ_(HV) may be less than π, less than the minimum approximate remote vehicle heading angle δ_(RV) _(min) ⁰¹, less than the maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹, and the remote vehicle heading and the host vehicle heading may be directionally opposed (RQ=10).

FIG. 27 is a diagram of determining relative heading information with divergent paths in accordance with this disclosure. In some embodiments, the host vehicle angle δ_(HV) may be greater than π, greater than the minimum approximate remote vehicle heading angle δ_(RV) _(min) ⁰¹, greater than the maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹, and the remote vehicle heading and the host vehicle heading may be divergent. Although not shown expressly in FIG. 27, in some embodiments, the host vehicle angle δ_(HV) may be less than π, less than the minimum approximate remote vehicle heading angle δ_(RV) _(min) ⁰¹, less than the maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹, and the remote vehicle heading and the host vehicle heading may be divergent.

FIGS. 28 and 29 are diagrams of determining relative heading information wherein a difference between the remote vehicle heading angle and the reference direction is within a threshold in accordance with this disclosure. As shown in FIG. 28, the remote vehicle heading angle δ_(RV) may be less than heading approximation offset threshold φ_(C), the maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹ may be greater than the remote vehicle heading angle δ_(RV) and the minimum approximate remote vehicle heading angle δ_(RV) _(min) ⁰¹ may be greater than the maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹. As shown in FIG. 29, a sum of the remote vehicle heading angle δ_(RV) and the heading approximation offset φ_(C) may be less than 2π, the maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹ may be less than the remote vehicle heading angle δ_(RV), and the minimum approximate remote vehicle heading angle δ_(RV) _(min) ⁰¹ may be greater than the maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹.

In some embodiments, the host vehicle angle δ_(RV) may be greater than π, the maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹ may be less than the host vehicle angle δ_(RV), the host vehicle angle δ_(RV) may be less than the minimum approximate remote vehicle heading angle δ_(RV) _(min) ⁰¹, and a false negative incorrectly indicating that the expected path for the remote vehicle and the expected path for the host vehicle are divergent may be identified. In some embodiments, the host vehicle angle δ_(RV) may be less than π, the maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹ may be less than the host vehicle angle δ_(RV), the host vehicle angle δ_(RV) may be less than the minimum approximate remote vehicle heading angle δ_(RV) _(min) ⁰¹, and a false negative incorrectly indicating that the expected path for the remote vehicle and the expected path for the host vehicle are divergent may be identified. In some embodiments, generating converging path information may include using a stabilization function such that the false negative is correctly identified as convergent.

In some embodiments, determining relative heading information using a stabilization function may include determining a minimum stabilization metric H₁, a maximum stabilization metric H₂, or both. The host vehicle heading angle δ_(RV) may be at least zero and may be less than 2π, the remote vehicle heading angle δ_(RV) may be at least zero and may be less than 2π, the minimum approximate remote vehicle heading angle δ_(RV) _(min) ⁰¹ may be at least zero and may be less than 2π, the maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹ may be at least zero and may be less than 2π, the minimum stabilization metric H₁ may be greater than zero (positive) or less than zero (negative), and the maximum stabilization metric H₂ may be greater than zero (positive) or less than zero (negative).

In some embodiments, determining relative heading information using a stabilization function may include determining a minimum stabilization metric H₁ by subtracting the minimum approximate remote vehicle heading angle δ_(RV) _(min) ⁰¹ from the host vehicle heading angle δ_(RV), which may be expressed as H₁=δ_(RV)−δ_(RV) _(min) ⁰¹, determining a maximum stabilization metric H₂ by subtracting the maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹ from the host vehicle heading angle δ_(RV), which may be expressed as H₂=δ_(RV)−δ_(RV) _(max) ⁰¹, or generating the minimum stabilization metric and the maximum stabilization metric.

In some embodiments, the host vehicle heading angle δ_(RV) may be less than the minimum approximate remote vehicle heading angle δ_(RV) _(min) ⁰¹, the host vehicle heading angle δ_(RV) may be less than the maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹, the minimum stabilization metric H₁ may be a negative value, the maximum stabilization metric H₂ may be a negative value, and the minimum stabilization metric H₁ may be greater than the maximum stabilization metric H₂.

In some embodiments, the host vehicle heading angle δ_(RV) may be less than the minimum approximate remote vehicle heading angle δ_(RV) _(min) ⁰¹, the host vehicle heading angle δ_(RV) may be greater than the maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹, the minimum stabilization metric H₁ may be a negative value, the maximum stabilization metric H₂ may be a positive value, and the minimum stabilization metric H₁ may be less than the maximum stabilization metric H₂.

In some embodiments, the host vehicle heading angle δ_(RV) may be greater than the minimum approximate remote vehicle heading angle δ_(RV) _(min) ⁰¹, the host vehicle heading angle δ_(RV) may be greater than the maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹, the minimum stabilization metric H₁ may be a positive value, the maximum stabilization metric H₂ may be a positive value, and the minimum stabilization metric H₁ may be greater than the maximum stabilization metric H₂.

In some embodiments, a first partial stabilization function Δ₁ ⁰¹ may be expressed as the following:

$\begin{matrix} {\Delta_{1}^{10} = {{\frac{1}{8}\left\lbrack {\frac{\delta_{RV} - \delta_{{RV}_{\min}}^{10} + \sigma}{{{\delta_{RV} - \delta_{{RV}_{\min}}^{10}}} + \sigma} + 1} \right\rbrack} \times {\quad{\left\lbrack {\frac{\delta_{{RV}_{\max}}^{10} - \delta_{RV} + \sigma}{{{\delta_{{RV}_{\max}}^{10} - \delta_{RV}}} + \sigma} + 1} \right\rbrack \times {\left\lbrack {\frac{H_{1} - H_{2} - \sigma}{{{H_{1} - H_{2}}} + \sigma} + 1} \right\rbrack.}}}}} & \left\lbrack {{Equation}\mspace{14mu} 73} \right\rbrack \end{matrix}$

In some embodiments, the minimum stabilization metric H₁ may be greater than the maximum stabilization metric H₂, the remote vehicle heading angle δ_(RV) may be at least the minimum approximate remote vehicle heading angle δ_(RV) _(min) ⁰¹, the remote vehicle heading angle δ_(RV) may be within the maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹ and the first partial stabilization function Δ₁ ⁰¹ may evaluate to one. In some embodiments, the minimum stabilization metric H₁ may be within the maximum stabilization metric H₂, the remote vehicle heading angle δ_(RV) may be less than the minimum approximate remote vehicle heading angle δ_(RV) _(min) ⁰¹, or the remote vehicle heading angle δ_(RV) may exceed the maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹, and the first partial stabilization function Δ₁ ⁰¹ may evaluate to zero.

In some embodiments, a second partial stabilization function Δ₂ ⁰¹ may be expressed as the following:

$\begin{matrix} {\Delta_{1}^{10} = {{\frac{1}{8}\left\lbrack {\frac{\delta_{RV} - \delta_{{RV}_{\min}}^{10} + \sigma}{{{\delta_{RV} - \delta_{{RV}_{\min}}^{10}}} + \sigma} + 1} \right\rbrack} \times {\quad{\left\lbrack {\frac{\delta_{RV} - \delta_{{RV}_{\max}}^{10} + \sigma}{{{\delta_{RV} - \delta_{{RV}_{\max}}^{10}}} + \sigma} + 1} \right\rbrack \times {\left\lbrack {1 - \frac{H_{1} - H_{2} - \sigma}{{{H_{1} - H_{2}}} + \sigma}} \right\rbrack.}}}}} & \left\lbrack {{Equation}\mspace{14mu} 74} \right\rbrack \end{matrix}$

In some embodiments, the minimum stabilization metric H₁ may be less than the maximum stabilization metric H₂, the minimum approximate remote vehicle heading angle δ_(RV) _(min) ¹⁰ may be within the remote vehicle heading angle δ_(RV), the maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹ may be within the remote vehicle heading angle δ_(RV), and the second partial stabilization function Δ₂ ⁰¹ may evaluate to one. In some embodiments, the minimum stabilization metric H₁ may be at least the maximum stabilization metric H₂, the minimum approximate remote vehicle heading angle δ_(RV) _(min) ⁰¹ may exceed the remote vehicle heading angle δ_(RV), or the maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹ may exceed the remote vehicle heading angle δ_(RV), and the second partial stabilization function Δ₂ ⁰¹ may evaluate to zero.

In some embodiments, a third partial stabilization function Δ₃ ⁰¹ may be expressed as the following:

$\begin{matrix} {\Delta_{3}^{10} = {{\frac{1}{8}\left\lbrack {\frac{\delta_{{RV}_{\min}}^{10} - \delta_{RV} + \sigma}{{{\delta_{{RV}_{\min}}^{10} - \delta_{RV}}} + \sigma} + 1} \right\rbrack} \times {\quad{\left\lbrack {\frac{\delta_{{RV}_{\max}}^{10} - \delta_{RV} + \sigma}{{{\delta_{{RV}_{\max}}^{10} - \delta_{RV}}} + \sigma} + 1} \right\rbrack \times {\left\lbrack {1 - \frac{H_{1} - H_{2} - \sigma}{{{H_{1} - H_{2}}} + \sigma}} \right\rbrack.}}}}} & \left\lbrack {{Equation}\mspace{14mu} 75} \right\rbrack \end{matrix}$

In some embodiments, the minimum stabilization metric H₁ may be less than the maximum stabilization metric H₂, the remote vehicle heading angle δ_(RV) may be within the minimum approximate remote vehicle heading angle δ_(RV) _(min) ⁰¹, the remote vehicle heading angle δ_(RV) may be within the maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹, and the third partial stabilization function Δ₁ ⁰¹ may evaluate to one. In some embodiments, the minimum stabilization metric H₁ may be at least the maximum stabilization metric H₂, the remote vehicle heading angle δ_(RV) may exceed the minimum approximate remote vehicle heading angle δ_(RV) _(min) ⁰¹, or the maximum approximate remote vehicle heading angle δ_(RV) _(max) ⁰¹ may exceed the remote vehicle heading angle δ_(RV), and the third partial stabilization function Δ₃ ⁰¹ may evaluate to zero.

In some embodiments, the difference between the minimum stabilization metric H₁ and the maximum stabilization metric H₂ may be expressed as the following:

H ₁ −H ₂=δ_(HV)−δ_(RV) _(min) ⁰¹−(δ_(HV)−δ_(RV) _(max) ⁰¹),

H ₁ −H ₂=δ_(HV)−δ_(RV) _(min) ⁰¹−δ_(HV)+δ_(RV) _(max) ⁰¹,

H ₁ −H ₂=δ_(RV) _(max) ⁰¹−δ_(RV) _(min) ⁰¹,  [Equation 76]

In some embodiments, the first partial stabilization function Δ₁ ⁰¹ may be expressed as the following:

$\begin{matrix} {\Delta_{1}^{10} = {{\frac{1}{8}\left\lbrack {\frac{\delta_{RV} - \delta_{{RV}_{\min}}^{10} + \sigma}{{{\delta_{RV} - \delta_{{RV}_{\min}}^{10}}} + \sigma} + 1} \right\rbrack} \times {\quad{\left\lbrack {\frac{\delta_{{RV}_{\max}}^{10} - \delta_{RV} + \sigma}{{{\delta_{{RV}_{\max}}^{10} - \delta_{RV}}} + \sigma} + 1} \right\rbrack \times {\left\lbrack {\frac{\delta_{{RV}_{\max}}^{10} - \delta_{{RV}_{\min}}^{10} - \sigma}{{{\delta_{{RV}_{\max}}^{10} - \delta_{{RV}_{\min}}^{10}}} + \sigma} + 1} \right\rbrack.}}}}} & \left\lbrack {{Equation}\mspace{14mu} 77} \right\rbrack \end{matrix}$

In some embodiments, the second partial stabilization function Δ₂ ⁰¹ may be expressed as the following:

$\begin{matrix} {\Delta_{2}^{10} = {{\frac{1}{8}\left\lbrack {\frac{\delta_{RV} - \delta_{{RV}_{\min}}^{10} + \sigma}{{{\delta_{RV} - \delta_{{RV}_{\min}}^{10}}} + \sigma} + 1} \right\rbrack} \times {\quad{\left\lbrack {\frac{\delta_{RV} - \delta_{{RV}_{\max}}^{10} + \sigma}{{{\delta_{RV} - \delta_{{RV}_{\max}}^{10}}} + \sigma} + 1} \right\rbrack \times {\quad{\left\lbrack {1 - \frac{\delta_{{RV}_{\max}}^{10} - \delta_{{RV}_{\min}}^{10} - \sigma}{{{\delta_{{RV}_{\max}}^{10} - \delta_{{RV}_{\min}}^{10}}} + \sigma} + 1} \right\rbrack.}}}}}} & \left\lbrack {{Equation}\mspace{14mu} 78} \right\rbrack \end{matrix}$

In some embodiments, the third partial stabilization function Δ₃ ⁰¹ may be expressed as the following:

$\begin{matrix} {\Delta_{3}^{10} = {{\frac{1}{8}\left\lbrack {\frac{\delta_{{RV}_{\min}}^{10} - \delta_{RV} + \sigma}{{{\delta_{{RV}_{\min}}^{10} - \delta_{RV}}} + \sigma} + 1} \right\rbrack} \times {\quad{\left\lbrack {\frac{\delta_{{RV}_{\max}}^{10} - \delta_{RV} + \sigma}{{{\delta_{{RV}_{\max}}^{10} - \delta_{RV}}} + \sigma} + 1} \right\rbrack \times {\quad{\left\lbrack {1 - \frac{\delta_{{RV}_{\max}}^{10} - \delta_{{RV}_{\min}}^{10} - \sigma}{{{\delta_{{RV}_{\max}}^{10} - \delta_{{RV}_{\min}}^{10}}} + \sigma} + 1} \right\rbrack.}}}}}} & \left\lbrack {{Equation}\mspace{14mu} 79} \right\rbrack \end{matrix}$

In some embodiments, the sum of the first partial stabilization function Δ₁ ¹⁰, the second partial stabilization function Δ₂ ¹⁰, and the third partial stabilization function Δ₃ ⁰¹ may be one and the remote vehicle and the host vehicle may be determined to be traveling in the opposite direction (RQ=10), which may be expressed as the following:

$\begin{matrix} {{{{\sum\limits_{i = 1}^{3}\Delta_{i}^{01}} = 1};}{{r_{2} = {\sum\limits_{i = 1}^{3}{\Delta_{i}^{10} \times 1}}},{q_{2} = {\sum\limits_{i = 1}^{3}{\Delta_{i}^{10} \times 0}}}}} & \left\lbrack {{Equation}\mspace{14mu} 80} \right\rbrack \end{matrix}$

FIG. 30 is a diagram of determining relative heading information for directionally crossing vehicles in accordance with this disclosure. In some embodiments, determining relative heading information may include determining relative heading information wherein the remote vehicle heading and the host vehicle heading are directionally crossing (RQ=11). Although only one example of the remote vehicle crossing with the host vehicle is shown, any angle wherein the remote vehicle is crossing with the host vehicle, as described herein, may be used.

In some embodiments, determining relative heading information wherein the remote vehicle heading and the host vehicle heading are crossing from the left may include identifying a minimum left approximate remote vehicle heading angle δ_(RV) _(minL) ¹¹. In some embodiments, determining relative heading information wherein the remote vehicle heading and the host vehicle heading are crossing from the right may include identifying a minimum right approximate remote vehicle heading angle δ_(RV) _(minR) ¹¹. In some embodiments, determining the minimum left approximate remote vehicle heading angle δ_(RV) _(minL) ¹¹ or the minimum right approximate remote vehicle heading angle δ_(RV) _(minR) ¹¹ may include using a left cross heading approximation offset φ_(L), such that φ₁=π/2−φ_(L) and φ₂=π/2+φ_(L); or a right cross heading approximation offset φ_(R), such that φ₃=3π/2−φ_(R) and φ₄=3π/2+φ_(R); and determining the minimum remote vehicle heading approximation angle may be expressed as shown in Equation 81 and determining the maximum remote vehicle heading approximation angle may be expressed as shown in Equation 82, as follows:

$\begin{matrix} {\delta_{{RV}_{minL}}^{11} = {{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - 0 + \sigma}{{{\delta_{HV} - 0}} + \sigma} + 1} \right\rbrack} \times {\quad{{\left\lbrack {\frac{\phi_{4} - \delta_{HV} - \sigma}{{{\phi_{4} - \delta_{HV}}} + \sigma} + 1} \right\rbrack \times \left( {\delta_{HV} + \phi_{1}} \right)} + {{\frac{1}{4}\left\lbrack \frac{\delta_{HV} - \phi_{4} + \sigma}{{{\delta_{HV} - \phi_{4}}} + \sigma} \right\rbrack} \times {\quad{{\left\lbrack {\frac{{2\pi} - \delta_{HV} - \sigma}{{{{2\pi} - \delta_{HV}}} + \sigma} + 1} \right\rbrack \times \left( {\delta_{HV} - \phi_{4}} \right)};{\delta_{{RV}_{minR}}^{11} = {{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - 0 + \sigma}{{{\delta_{HV} - 0}} + \sigma} + 1} \right\rbrack} \times {\quad{{\left\lbrack {\frac{\phi_{2} - \delta_{HV} - \sigma}{{{\phi_{2} - \delta_{HV}}} + \sigma} + 1} \right\rbrack \times \left( {\delta_{HV} + \phi_{3}} \right)} + {{\frac{1}{4}\left\lbrack \frac{\delta_{HV} - \phi_{2} + \sigma}{{{\delta_{HV} - \phi_{2}}} + \sigma} \right\rbrack} \times {\quad{\left\lbrack {\frac{{2\pi} - \delta_{HV} - \sigma}{{{{2\pi} - \delta_{HV}}} + \sigma} + 1} \right\rbrack \times {\left( {\delta_{HV} - \phi_{2}} \right).}}}}}}}}}}}}}}} & \left\lbrack {{Equation}\mspace{14mu} 81} \right\rbrack \\ {\delta_{{RV}_{maxL}}^{11} = {{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - 0 + \sigma}{{{\delta_{HV} - 0}} + \sigma} + 1} \right\rbrack} \times {\quad{{\left\lbrack {\frac{\phi_{3} - \delta_{HV} - \sigma}{{{\phi_{3} - \delta_{HV}}} + \sigma} + 1} \right\rbrack \times \left( {\delta_{HV} + \phi_{2}} \right)} + {{\frac{1}{4}\left\lbrack \frac{\delta_{HV} - \phi_{3} + \sigma}{{{\delta_{HV} - \phi_{3}}} + \sigma} \right\rbrack} \times {\quad{{\left\lbrack {\frac{{2\pi} - \delta_{HV} - \sigma}{{{{2\pi} - \delta_{HV}}} + \sigma} + 1} \right\rbrack \times \left( {\delta_{HV} - \phi_{3}} \right)};{\delta_{{RV}_{maxR}}^{11} = {{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - 0 + \sigma}{{{\delta_{HV} - 0}} + \sigma} + 1} \right\rbrack} \times {\quad{{\left\lbrack {\frac{\phi_{1} - \delta_{HV} - \sigma}{{{\phi_{1} - \delta_{HV}}} + \sigma} + 1} \right\rbrack \times \left( {\delta_{HV} + \phi_{4}} \right)} + {{\frac{1}{4}\left\lbrack \frac{\delta_{HV} - \phi_{1} + \sigma}{{{\delta_{HV} - \phi_{1}}} + \sigma} \right\rbrack} \times {\quad{\left\lbrack {\frac{{2\pi} - \delta_{HV} - \sigma}{{{{2\pi} - \delta_{HV}}} + \sigma} + 1} \right\rbrack \times {\left( {\delta_{HV} - \phi_{1}} \right).}}}}}}}}}}}}}}} & \left\lbrack {{Equation}\mspace{14mu} 82} \right\rbrack \end{matrix}$

In some embodiments, A₁=β₁+π/2−φ_(P), A₂=β₁+π/2+φ_(P), A₃=β₁+3π/2−φ_(P), A₄=β₁+3π/2+φ_(P), A₅=β₁−φ_(I), A₆=β₁+φ_(I), A₇=β₁+π−φ_(I), A₈=β₁+π+φ_(I), A₉=β₁−π/2−φ_(P), A₁₀=β₁−π/2+φ_(P), A₁₁=β₁−π−φ_(I), A₁₂=β₁−π+φ_(I), A₁₃=β₁−φ_(I), A₁₄=β₁+φ_(I), A₁₅=β₁−3π/2−φ_(P), and A₁₆=β₁−3π/2+φ_(P), and the minimum approximate remote vehicle heading angle δ_(RV) _(min) ¹¹ and the maximum approximate remote vehicle heading angle δ_(RV) _(mzx) ¹¹ may be respectively expressed as shown in the following:

$\begin{matrix} {{L_{Q_{1}} = {L_{Q_{4}} = {{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - A_{6} + \sigma}{{{\delta_{HV} - A_{6}}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{A_{7} - \delta_{HV} - \sigma}{{{A_{7} - \delta_{HV}}} + \sigma} + 1} \right\rbrack}}},{L_{Q_{2}} = {L_{Q_{3}} = {{{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - 0 + \sigma}{{{\delta_{HV} - 0}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{A_{11} - \delta_{HV} - \sigma}{{{A_{11} - \delta_{HV}}} + \sigma} + 1} \right\rbrack} + {{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - A_{14} + \sigma}{{{\delta_{HV} - A_{14}}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{{2\pi} - \delta_{HV} - \sigma}{{{{2\pi} - \delta_{HV}}} + \sigma} + 1} \right\rbrack}}}},{R_{Q_{1}} = {R_{Q_{4}} = {{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - 0 + \sigma}{{{\delta_{HV} - 0}} + \sigma} + 1} \right\rbrack} \times {\quad{{\left\lbrack {\frac{A_{5} - \delta_{HV} - \sigma}{{{A_{5} - \delta_{HV}}} + \sigma} + 1} \right\rbrack + {{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - A_{8} + \sigma}{{{\delta_{HV} - A_{8}}} + \sigma} + 1} \right\rbrack} \times \left\lbrack {\frac{{2\pi} - \delta_{HV} - \sigma}{{{{2\pi} - \delta_{HV}}} + \sigma} + 1} \right\rbrack}},{R_{Q_{2}} = {R_{Q_{3}} = {{\frac{1}{4}\left\lbrack {\frac{\delta_{HV} - A_{12} + \sigma}{{{\delta_{HV} - A_{12}}} + \sigma} + 1} \right\rbrack} \times {\quad{\left\lbrack {\frac{A_{13} - \delta_{HV} - \sigma}{{{A_{13} - \delta_{HV}}} + \sigma} + 1} \right\rbrack;{\delta_{{RV}_{\min}}^{11} = {{\delta_{{RV}_{minL}}^{11} \times {\frac{1}{2}\left\lbrack {\frac{L_{Q_{1}} + L_{Q_{2}} - \sigma}{{{L_{Q_{1}} + L_{Q_{2}}}} + \sigma} + 1} \right\rbrack}} + {\delta_{{RV}_{minR}}^{11} \times {\frac{1}{2}\left\lbrack {\frac{R_{Q_{1}} + R_{Q_{2}} - \sigma}{{{R_{Q_{1}} + R_{Q_{2}}}} + \sigma} + 1} \right\rbrack}}}};{\delta_{{RV}_{\max}}^{11} = {{\delta_{{RV}_{maxL}}^{11} \times {\frac{1}{2}\left\lbrack {\frac{L_{Q_{1}} + L_{Q_{2}} - \sigma}{{{L_{Q_{1}} + L_{Q_{2}}}} + \sigma} + 1} \right\rbrack}} + {\delta_{{RV}_{maxR}}^{11} \times {{\frac{1}{2}\left\lbrack {\frac{R_{Q_{1}} + R_{Q_{2}} - \sigma}{{{R_{Q_{1}} + R_{Q_{2}}}} + \sigma} + 1} \right\rbrack}.}}}}}}}}}}}}}}} & \left\lbrack {{Equation}\mspace{14mu} 83} \right\rbrack \end{matrix}$

In some embodiments, remote vehicle heading angle δ_(RV) may be within the range from the minimum approximate remote vehicle heading angle δ_(RV) _(min) ¹¹ to the maximum approximate remote vehicle heading angle δ_(RV) _(mzx) ¹¹, and the remote vehicle may be identified as crossing with the host vehicle.

In some embodiments, the remote vehicle may be crossing with the host vehicle from the left, which may be expressed as follows:

$\begin{matrix} \left. {0 \leq \delta_{HV} < {\frac{3\pi}{2} - \phi_{L}}}\rightarrow\left\{ {\begin{matrix} {\delta_{HV} < \delta_{{RV}_{\min}}^{11}} \\ {\delta_{HV} < \delta_{{RV}_{\max}}^{11}} \end{matrix},\left. {{\frac{3\pi}{2} - \phi_{L}} \leq \delta_{HV} < {\frac{3\pi}{2} + \phi_{L}}}\rightarrow\left\{ {\begin{matrix} {\delta_{HV} < \delta_{{RV}_{\min}}^{11}} \\ {\delta_{HV} > \delta_{{RV}_{\max}}^{11}} \end{matrix},\left. {{\frac{3\pi}{2} + \phi_{L}} \leq \delta_{HV} < {2\pi}}\rightarrow\left\{ {\begin{matrix} {\delta_{HV} > \delta_{{RV}_{\min}}^{11}} \\ {\delta_{HV} > \delta_{{RV}_{\max}}^{11}} \end{matrix}.} \right. \right.} \right. \right.} \right. \right. & \left\lbrack {{Equation}\mspace{14mu} 84} \right\rbrack \end{matrix}$

In some embodiments, the remote vehicle may be crossing with the host vehicle from the right, which may be expressed as follows:

$\begin{matrix} \left. {0 \leq \delta_{HV} < {\frac{\pi}{2} - \phi_{R}}}\rightarrow\left\{ {\begin{matrix} {\delta_{HV} < \delta_{{RV}_{\min}}^{11}} \\ {\delta_{HV} < \delta_{{RV}_{\max}}^{11}} \end{matrix},\left. {{\frac{\pi}{2} - \phi_{R}} \leq \delta_{HV} < {\frac{\pi}{2} + \phi_{R}}}\rightarrow\left\{ {\begin{matrix} {\delta_{HV} < \delta_{{RV}_{\min}}^{11}} \\ {\delta_{HV} > \delta_{{RV}_{\max}}^{11}} \end{matrix},\left. {{\frac{\pi}{2} + \phi_{R}} \leq \delta_{HV} < {2\pi}}\rightarrow\left\{ {\begin{matrix} {\delta_{HV} > \delta_{{RV}_{\min}}^{11}} \\ {\delta_{HV} > \delta_{{RV}_{\max}}^{11}} \end{matrix}.} \right. \right.} \right. \right.} \right. \right. & \left\lbrack {{Equation}\mspace{14mu} 85} \right\rbrack \end{matrix}$

In some embodiments, determining relative heading information using a stabilization function may include determining a minimum stabilization metric H₁, a maximum stabilization metric H₂, or both. The host vehicle heading angle δ_(HV) may be at least zero and may be less than 2π, the remote vehicle heading angle δ_(RV) may be at least zero and may be less than 2π, the minimum approximate remote vehicle heading angle δ_(RV) _(min) ¹⁰ may be at least zero and may be less than 2π, the maximum approximate remote vehicle heading angle δ_(RV) _(max) ¹⁰ may be at least zero and may be less than 2π, the minimum stabilization metric H₁ may be greater than zero (positive) or less than zero (negative), and the maximum stabilization metric H₂ may be greater than zero (positive) or less than zero (negative).

In some embodiments, determining relative heading information using a stabilization function may include determining a minimum stabilization metric H₁ by subtracting the minimum approximate remote vehicle heading angle δ_(RV) _(min) ¹¹ from the host vehicle heading angle δ_(RV), which may be expressed as H₁=δ_(HV)−δ_(RV) _(min) ¹¹, determining a maximum stabilization metric H₂ by subtracting the maximum approximate remote vehicle heading angle δ_(RV) _(max) ¹¹ from the host vehicle heading angle δ_(RV), which may be expressed as H₂=δ_(RV)−δ_(RV) _(max) ¹¹, or generating the minimum stabilization metric and the maximum stabilization metric.

In some embodiments, the minimum stabilization metric H₁ may be a negative value, the maximum stabilization metric H₂ may be a negative value, and the minimum stabilization metric H₁ may be greater than the maximum stabilization metric H₂. In some embodiments, the minimum stabilization metric H₁ may be a negative value, the maximum stabilization metric H₂ may be a positive value, and the minimum stabilization metric H₁ may be less than the maximum stabilization metric H₂. In some embodiments, the minimum stabilization metric H₁ may be a positive value, the maximum stabilization metric H₂ may be a positive value, and the minimum stabilization metric H₁ may be greater than the maximum stabilization metric H₂.

In some embodiments, a first partial stabilization function may be expressed as the following:

$\begin{matrix} {\Delta_{1}^{11} = {{\frac{1}{8}\left\lbrack {\frac{\delta_{RV} - \delta_{{RV}_{m\; i\; n}}^{11} + \sigma}{{{\delta_{RV} - \delta_{{RV}_{m\; i\; n}}^{11}}} + \sigma} + 1} \right\rbrack} \times {\quad{\left\lbrack {\frac{\delta_{{RV}_{{ma}\; x}}^{11} - \delta_{RV} + \sigma}{{{\delta_{{RV}_{{ma}\; x}}^{11} - \delta_{RV}}} + \sigma} + 1} \right\rbrack \times {\left\lbrack {\frac{H_{1} - H_{2} - \sigma}{{{H_{1} - H_{2}}} + \sigma} + 1} \right\rbrack.}}}}} & \left\lbrack {{Equation}\mspace{14mu} 86} \right\rbrack \end{matrix}$

In some embodiments, the minimum stabilization metric H₁ may be greater than the maximum stabilization metric H₂, the minimum approximate remote vehicle heading angle δ_(RV) _(min) ⁰¹ may be within the remote vehicle heading angle δ_(RV), the remote vehicle heading angle δ_(RV) may be less than the maximum approximate remote vehicle heading angle δ_(RV) _(max) ¹⁰, and the first partial stabilization function Δ₁ ¹¹ may evaluate to one. In some embodiments, the minimum stabilization metric H₁ may be within the maximum stabilization metric H₂, the minimum approximate remote vehicle heading angle δ_(RV) _(min) ¹¹ may be less than the remote vehicle heading angle δ_(RV), or the remote vehicle heading angle δ_(RV) may be at least the maximum approximate remote vehicle heading angle δ_(RV) _(max) ¹⁰, and the first partial stabilization function Δ₁ ¹¹ may evaluate to zero.

In some embodiments, a second partial stabilization function Δ₂ ¹¹ may be expressed as the following:

$\begin{matrix} {\Delta_{2}^{11} = {{\frac{1}{8}\left\lbrack {\frac{\delta_{{RV}_{m\; i\; n}}^{11} - \delta_{RV} + \sigma}{{{\delta_{{RV}_{m\; i\; n}}^{11} - \delta_{RV}}} + \sigma} + 1} \right\rbrack} \times {\quad{\left\lbrack {\frac{\delta_{{RV}_{{ma}\; x}}^{11} - \delta_{RV} + \sigma}{{{\delta_{{RV}_{{ma}\; x}}^{11} - \delta_{RV}}} + \sigma} + 1} \right\rbrack \times {\left\lbrack {1 - \frac{H_{1} - H_{2} - \sigma}{{{H_{1} - H_{2}}} + \sigma}} \right\rbrack.}}}}} & \left\lbrack {{Equation}\mspace{14mu} 87} \right\rbrack \end{matrix}$

In some embodiments, the minimum stabilization metric H₁ may be less than the maximum stabilization metric H₂, the minimum approximate remote vehicle heading angle δ_(RV) _(min) ¹⁰ may be within the remote vehicle heading angle δ_(RV), the maximum approximate remote vehicle heading angle δ_(RV) _(max) ¹⁰ may be within the remote vehicle heading angle δ_(RV), and the second partial stabilization function Δ₂ ¹¹ may evaluate to one. In some embodiments, the minimum stabilization metric H₁ may be at least the maximum stabilization metric H₂, the minimum approximate remote vehicle heading angle δ_(RV) _(min) ¹¹ may exceed the remote vehicle heading angle δ_(RV), or the maximum approximate remote vehicle heading angle δ_(RV) _(max) ¹¹ may exceed the remote vehicle heading angle δ_(RV), and the second partial stabilization function Δ₂ ¹¹ may evaluate to zero.

In some embodiments, a third partial stabilization Δ₃ ¹¹ may be expressed as the following:

$\begin{matrix} {\Delta_{3}^{11} = {{\frac{1}{8}\left\lbrack {\frac{\delta_{RV} - \delta_{{RV}_{m\; i\; n}}^{11} + \sigma}{{{\delta_{RV} - \delta_{{RV}_{m\; i\; n}}^{11}}} + \sigma} + 1} \right\rbrack} \times {\quad{\left\lbrack {\frac{\delta_{RV} - \delta_{{RV}_{{ma}\; x}}^{11} + \sigma}{{{\delta_{RV} - \delta_{{RV}_{{ma}\; x}}^{11}}} + \sigma} + 1} \right\rbrack \times {\left\lbrack {1 - \frac{H_{1} - H_{2} - \sigma}{{{H_{1} - H_{2}}} + \sigma}} \right\rbrack.}}}}} & \left\lbrack {{Equation}\mspace{14mu} 88} \right\rbrack \end{matrix}$

In some embodiments, the minimum stabilization metric H₁ may be less than the maximum stabilization metric H₂, the minimum approximate remote vehicle heading angle δ_(RV) _(min) ¹¹ may be within the remote vehicle heading angle δ_(RV), the maximum approximate remote vehicle heading angle δ_(RV) _(max) ¹¹ may be within the remote vehicle heading angle δ_(RV), and the third partial stabilization Δ₃ ¹¹ may evaluate to one. In some embodiments, the minimum stabilization metric H₁ may be at least the maximum stabilization metric H₂, the minimum approximate remote vehicle heading angle δ_(RV) _(min) ¹¹ may exceed the remote vehicle heading angle δ_(RV), or the maximum approximate remote vehicle heading angle δ_(RV) _(max) ¹¹ may exceed the remote vehicle heading angle δ_(RV), and the third partial stabilization function Δ₃ ¹¹ may evaluate to zero.

In some embodiments, the difference between the minimum stabilization metric H₁ and the maximum stabilization metric H₂ may be expressed as the following:

H ₁ −H ₂=δ_(HV)−δ_(RV) _(min) ¹¹−(δ_(HV)−δ_(RV) _(max) ¹¹),

H ₁ −H ₂=δ_(HV)−δ_(RV) _(min) ¹¹−δ_(HV)+δ_(RV) _(max) ¹¹,

H ₁ −H ₂=δ_(RV) _(max) ¹¹−δ_(RV) _(min) ¹¹  [Equation 89]

In some embodiments, the first partial stabilization function Δ₁ ¹¹ may be expressed as the following:

$\begin{matrix} {\Delta_{1}^{11} = {{\frac{1}{8}\left\lbrack {\frac{\delta_{RV} - \delta_{{RV}_{m\; i\; n}}^{11} + \sigma}{{{\delta_{RV} - \delta_{{RV}_{m\; i\; n}}^{11}}} + \sigma} + 1} \right\rbrack} \times {\quad{\left\lbrack {\frac{\delta_{{RV}_{{ma}\; x}}^{11} - \delta_{RV} + \sigma}{{{\delta_{{RV}_{{ma}\; x}}^{11} - \delta_{RV}}} + \sigma} + 1} \right\rbrack \times {\left\lbrack {\frac{\delta_{{RV}_{{ma}\; x}}^{11} - \delta_{{RV}_{m\; i\; n}}^{11} - \sigma}{{{\delta_{{RV}_{{ma}\; x}}^{11} - \delta_{{RV}_{m\; i\; n}}^{11}}} + \sigma} + 1} \right\rbrack.}}}}} & \left\lbrack {{Equation}\mspace{14mu} 90} \right\rbrack \end{matrix}$

In some embodiments, the second partial stabilization function Δ₂ ¹¹ may be expressed as the following:

$\begin{matrix} {\Delta_{2}^{11} = {{\frac{1}{8}\left\lbrack {\frac{\delta_{{RV}_{m\; i\; n}}^{11} - \delta_{RV} + \sigma}{{{\delta_{{RV}_{m\; i\; n}}^{11} - \delta_{RV}}} + \sigma} + 1} \right\rbrack} \times {\quad{\left\lbrack {\frac{\delta_{{RV}_{{ma}\; x}}^{11} - \delta_{RV} + \sigma}{{{\delta_{{RV}_{{ma}\; x}}^{11} - \delta_{RV}}} + \sigma} + 1} \right\rbrack \times {\left\lbrack {1 - \frac{\delta_{{RV}_{{ma}\; x}}^{11} - \delta_{{RV}_{m\; i\; n}}^{11} + \sigma}{{{\delta_{{RV}_{{ma}\; x}}^{11} - \delta_{{RV}_{m\; i\; n}}^{11}}} + \sigma}} \right\rbrack.}}}}} & \left\lbrack {{Equation}\mspace{14mu} 91} \right\rbrack \end{matrix}$

In some embodiments, the third partial stabilization function Δ₃ ¹¹ may be expressed as the following:

$\begin{matrix} {\Delta_{3}^{11} = {{\frac{1}{8}\left\lbrack {\frac{\delta_{RV} - \delta_{{RV}_{m\; i\; n}}^{11} + \sigma}{{{\delta_{RV} - \delta_{{RV}_{m\; i\; n}}^{11}}} + \sigma} + 1} \right\rbrack} \times {\quad{\left\lbrack {\frac{\delta_{RV} - \delta_{{RV}_{{ma}\; x}}^{11} + \sigma}{{{\delta_{RV} - \delta_{{RV}_{{ma}\; x}}^{11}}} + \sigma} + 1} \right\rbrack \times {\left\lbrack {1 - \frac{\delta_{{RV}_{{ma}\; x}}^{11} - \delta_{{RV}_{m\; i\; n}}^{11} + \sigma}{{{\delta_{{RV}_{{ma}\; x}}^{11} - \delta_{{RV}_{m\; i\; n}}^{11}}} + \sigma}} \right\rbrack.}}}}} & \left\lbrack {{Equation}\mspace{14mu} 92} \right\rbrack \end{matrix}$

In some embodiments, the sum of the first partial stabilization function Δ₁ ¹¹, the second partial stabilization function Δ₂ ¹¹, and the third partial stabilization function Δ₃ ¹¹ may be one and the remote vehicle and the host vehicle may be determined to be traveling in crossing directions (RQ=11), which may be expressed as the following:

$\begin{matrix} {{{{\sum\limits_{i = 1}^{3}\Delta_{i}^{11}} = 1};}{{r_{3} = {\sum\limits_{i = 1}^{3}{\Delta_{i}^{11} \times 1}}},{q_{3} = {\sum\limits_{i = 1}^{3}{\Delta_{i}^{11} \times 1.}}}}} & \left\lbrack {{Equation}\mspace{14mu} 93} \right\rbrack \end{matrix}$

In some embodiments, determining whether the remote vehicle expected path and the host vehicle expected are convergent may be expressed as the following:

R=Σ _(i=1) ³ r _(i),

Q=Σ _(i=1) ³ q _(i),  [Equation 94]

In some embodiments, the relative heading information for the remote vehicle relative to the host vehicle may be expressed as a codeword, or partial codeword, such as a codeword, or partial codeword, including two bits (R, Q), as shown in Table 36 below.

TABLE 36 R Q r₀ = 0 q₀ = 0 r₁ = 0 $q_{1} = {\sum\limits_{i = 1}^{3}\; {\Delta_{i}^{01} \times 1}}$ $r_{2} = {\sum\limits_{i = 1}^{3}\; {\Delta_{i}^{10} \times 1}}$ q₂ = 0 $r_{3} = {\sum\limits_{i = 1}^{3}\; {\Delta_{i}^{11} \times 1}}$ $q_{3} = {\sum\limits_{i = 1}^{3}\; {\Delta_{i}^{11} \times 1}}$ $R = {\sum\limits_{i = 1}^{3}\; r_{i}}$ $Q = {\sum\limits_{i = 1}^{3}\; q_{i}}$

Although FIGS. 4-30 show examples of vehicles traveling along straight paths, generating converging path information may include using heading or expected path information that includes curved or turning paths.

FIG. 31 is a diagram of traversing a vehicle transportation network including generating converging path information in accordance with this disclosure. In some embodiments, traversing a vehicle transportation network including generating converging path information may be implemented in a vehicle, such as the vehicle 1000 shown in FIG. 1 or the vehicles 2100/2110 shown in FIG. 2.

In some embodiments, traversing a vehicle transportation network including generating converging path information may include traversing a first portion of the vehicle transportation network at 31000, receiving remote vehicle information at 31100, identifying host vehicle information at 31200, generating convergence information at 31300, traversing a second portion of the vehicle transportation network at 31400, or a combination thereof.

In some embodiments, a host vehicle may traverse a first portion of the vehicle transportation network at 31000. For example, a host vehicle, such as the host vehicle 1000 shown in FIG. 1 or the host vehicle 2100 shown in FIG. 2, may traverse a portion of a vehicle transportation network, such as the portion 2200 shown in FIG. 2.

In some embodiments, remote vehicle information may be received at 31100. For example, the host vehicle may receive a remote vehicle message from a remote vehicle, such as from the remote vehicle 2110 shown in FIG. 2, via a communication link, such as the wireless electronic communication link 2370 shown in FIG. 2. In some embodiments, the host vehicle may store the remote vehicle information. For example, the host vehicle may store the remote vehicle information in a memory of the host vehicle, such as the memory 1340 shown in FIG. 1.

The remote vehicle message may include remote vehicle information, which may indicate remote vehicle geospatial state information for the remote vehicle, remote vehicle kinematic state information for the remote vehicle, or a combination thereof. In some embodiments, remote vehicle geospatial state information may include geospatial coordinates for the remote vehicle, such as longitude and latitude coordinates. In some embodiments, the remote vehicle kinematic state information may include a remote vehicle velocity for the remote vehicle, a remote vehicle heading for the remote vehicle, a remote vehicle acceleration for the remote vehicle, or a remote vehicle yaw rate for the remote vehicle, or any other information, or combination of information, relevant to the operational state of the remote vehicle.

In some embodiments, host vehicle information may be identified at 31200. In some embodiments, the host vehicle information may include host vehicle geospatial state information for the host vehicle, host vehicle kinematic state information for the host vehicle, or a combination thereof. In some embodiments, the host vehicle geospatial state information may include geospatial coordinates for the host vehicle, such as longitude and latitude coordinates. In some embodiments, the host vehicle kinematic state information may include a host vehicle velocity for the host vehicle, a host vehicle heading for the host vehicle, a host vehicle acceleration for the host vehicle, or a host vehicle yaw rate for the host vehicle, or any other information, or combination of information, relevant to the operational state of the host vehicle.

In some embodiments, convergence, or converging path, information may be generated at 31300. For example, the host vehicle may generate converging path information based on the remote vehicle information received at 31100, the host vehicle information identified at 31200, or both. In some embodiments, generating convergence information at 31300 may be similar to generating convergence information as shown at 32000 in FIG. 32.

In some embodiments, the host vehicle may traverse a second portion of the vehicle transportation network at 31400. For example, the host vehicle may traverse the second portion of the vehicle transportation network based, at least in part, on the converging path information generated at 31300.

In some embodiments, traversing the second portion of the vehicle transportation network at 31400 may include traversing the second portion of the vehicle transportation network in response to a codeword representing the converging path information. In some embodiments, traversing the second portion of the vehicle transportation network at 31400 may include controlling the host vehicle to traverse a portion of the vehicle transportation network in response to the codeword. In some embodiments, the codeword may be a stabilized codeword.

In some embodiments, the host vehicle may generate converging path information for multiple remote vehicles, which may include generating a codeword, or stabilized codeword, for each remote vehicle. In some embodiments, the host vehicle may identify a priority for each identified remote vehicle man may traverse the vehicle transportation network based on the prioritization.

In some embodiments, traversing the second portion of the vehicle transportation network at 31400 may include determining that the codeword, or stabilized codeword, for a first remote vehicle indicates that the expected path for the first remote vehicle and the expected path for the host vehicle are divergent, and controlling the host vehicle in response to the codeword for the first remote vehicle may include storing or deleting the information for the first remote vehicle and generating a codeword, or stabilized codeword, based on information for a second remote vehicle to determine whether the expected path for the second remote vehicle and the expected path for the host vehicle are convergent, and controlling the host vehicle to traverse the second portion of the vehicle transportation network in response to the second codeword. For example, the codeword for a first remote vehicle may include relative heading information, such as RQ bits, which may indicate that the remote vehicle heading and the host vehicle heading are divergent (RQ=00), and a codeword may be generated for another remote vehicle.

FIG. 32 is a diagram of generating convergence, or converging path, information in accordance with this disclosure. In some embodiments, generating convergence information may be implemented in a vehicle, such as the vehicle 1000 shown in FIG. 1 or the vehicles 2100/2110 shown in FIG. 2. In some embodiments, generating convergence information at 32000 may be similar to generating convergence information as shown at 31300 in FIG. 31.

In some embodiments, generating convergence information may include determining a remote vehicle heading angle at 32100, determining a host vehicle heading angle at 32200, determining an orientation sector at 32300, determining relative position information at 32400, determining relative elevation information at 32500, determining relative heading information at 32600, or a combination thereof.

In some embodiments, a remote vehicle expected path may be determined at 32100. A remote vehicle expected path may be determined for a remote vehicle based on the remote vehicle information corresponding to the remote vehicle. For example, the remote vehicle information corresponding to the remote vehicle may include geospatial location information, such as longitude θ_(RV) and latitude information φ_(RV) and heading information for the remote vehicle, and the remote vehicle expected path may be determined based on the geospatial location information and heading information. In some embodiments, the remote vehicle expected path may correspond with the remote vehicle heading angle δ_(R), as shown in FIGS. 4-30. In some embodiments, the remote vehicle information may include information indicating that the remote vehicle may turn, such as active turn signal information, and the remote vehicle expected path may be determined based on the geo spatial location information, heading information, and the information indicating that the remote vehicle may turn.

In some embodiments, a host vehicle expected path may be determined at 32200. A host vehicle expected path may be determined for the host vehicle based on the host vehicle information for the host vehicle. For example, the host vehicle information may include geospatial location information, such as longitude θ_(HV) and latitude information φ_(HV), route information, heading information for the host vehicle, or a combination thereof, and the host vehicle expected path may be determined based on the geospatial location information and heading information. In some embodiments, the host vehicle expected path may correspond with the host vehicle heading angle δ_(HV), as shown in FIGS. 4-30. In some embodiments, the host vehicle information may include information indicating that the host vehicle may turn, such as active turn signal information or route information, and the host vehicle expected path may be determined based on the geospatial location information, heading information, and the information indicating that the host vehicle may turn.

In some embodiments, an orientation sector may be determined at 32300. In some embodiments, determining an orientation sector Q may be similar to determining an orientation sector Q as shown in FIG. 4. In some embodiments, determining an orientation sector may include determining a geodesic between the host vehicle and the remote vehicle and determining a convergence angle β₁ for the geodesic, which may be similar to determining a geodesic between the host vehicle and the remote vehicle and determining a convergence angle β₁ for the geodesic as shown in FIGS. 5, 9, 13, and 17. For example, the convergence angle β₁ may be determined using Equation 2. In some embodiments, the orientation sector may be determined relative to a reference direction, such as north.

In some embodiments, relative position information may be determined at 32400. In some embodiments, relative position information may be determined relative to the orientation sector identified at 32300. In some embodiments, determining the relative position information at 32400 may be similar to determining relative position information as shown in FIGS. 7-8, 11-12, 15-16, and 19-20. In some embodiments, the relative position information may be determined based on an orientation sector, such as the orientation sector identified at 32300, a host vehicle heading angle for the host vehicle, such as the host vehicle heading angle determined at 32200, a remote vehicle heading angle for the remote vehicle, such as the remote vehicle heading angle identified at 32100.

In some embodiments, determining the relative position information at 32400 may include determining a longitudinal relative position of the remote vehicle with respect to the host vehicle based on the orientation sector. In some embodiments, determining the longitudinal relative position may include determining the longitudinal relative position of the remote vehicle as ahead of the host vehicle, adjacent to the host vehicle, or behind the host vehicle, as shown in FIGS. 7, 11, 15, and 19. In some embodiments, the longitudinal relative position may be identified using a longitudinal angular offset threshold, such as the angular offset threshold φ_(P), which may define an angular range in which the remote vehicle may be determined to be adjacent to the host vehicle.

In some embodiments, determining the relative position information at 32400 may include determining a lateral relative position of the remote vehicle with respect to the host vehicle based on the orientation sector. In some embodiments, determining the lateral relative position may include determining the lateral relative position of the remote vehicle as to the left of the host vehicle, in-line with the host vehicle, or to the right of the host vehicle, as shown in FIGS. 8, 12, 16, and 20. In some embodiments, the lateral relative position may be identified using a lateral angular offset threshold, such as the angular offset threshold φ_(I), which may define an angular range in which the remote vehicle may be determined to be in-line with the host vehicle. In some embodiments, the longitudinal angular offset threshold and the lateral angular offset threshold may be equal.

In some embodiments, relative elevation information may be determined at 32500. In some embodiments, determining the relative elevation information at 32500 may be similar to determining relative elevation information as shown in FIG. 21. In some embodiments, the relative elevation information may be determined based on host vehicle elevation information, which may be identified from host vehicle information, such as the host vehicle information identified at 31200 as shown in FIG. 31; remote vehicle elevation information, which may be identified from remote vehicle information, such as the remote vehicle information identified at 31100 as shown in FIG. 31, and a spatial distance offset threshold. In some embodiments, determining relative elevation information at 32500 may include determining the relative elevation of the remote vehicle as higher than the host vehicle, level with the host vehicle, or lower than the host vehicle.

In some embodiments, relative heading information may be determined at 32600. In some embodiments, determining relative heading information at 32600 may be similar to determining relative heading information as shown in FIGS. 21-30. In some embodiments, determining relative heading information may include determining the relative heading of the remote vehicle as aligned with the host vehicle, opposite the host vehicle, or crossing with the host vehicle. In some embodiments, determining the relative heading information may include determining relative heading information based on a host vehicle heading angle for the host vehicle, such as the host vehicle heading angle determined at 32200, a remote vehicle heading angle for the remote vehicle, such as the remote vehicle heading angle identified at 32100, or both.

In some embodiments, determining the relative heading information may include determining whether the remote vehicle heading is aligned with the host vehicle heading as shown in FIGS. 22-25. For example, determining the relative heading information may include determining relative heading information based on a heading approximation offset threshold φ_(A), which may be an angular offset threshold, and which may indicate a defined range of heading angles in which the remote vehicle heading, or expected path, may be determined to be aligned with the host vehicle heading, or expected path.

In some embodiments, determining the relative heading information may include determining whether the remote vehicle heading is opposite to the host vehicle heading as shown in FIGS. 26-29. For example, determining the relative heading information may include determining relative heading information based on a heading approximation offset threshold φ_(C), which may be an angular offset threshold, and which may indicate a defined range of heading angles in which the remote vehicle heading, or expected path, may be determined to be opposite to the host vehicle heading, or expected path.

In some embodiments, determining the relative heading information may include determining whether the remote vehicle heading is crossing the host vehicle heading as shown in FIG. 30. For example, determining the relative heading information may include determining relative heading information based on a left cross heading approximation offset φ_(L), which may indicate a defined range of heading angles in which the remote vehicle heading, or expected path, may be determined to be crossing the host vehicle heading, or expected path, from the left. In another example, determining the relative heading information may include determining relative heading information based on a right cross heading approximation offset φ_(R), which may indicate a defined range of heading angles in which the remote vehicle heading, or expected path, may be determined to be crossing the host vehicle heading, or expected path, from the right.

Although not shown separately in FIG. 32, in some embodiments, generating convergence information may include generating a codeword indicating whether an expected path for the remote vehicle and an expected path for the host vehicle are convergent. For example, the codeword may be an eight bit codeword, wherein a first portion, such as a four-bit portion, may indicate relative position information, such as the relative position information determined at 32400, which may include a first two-bit sub-portion indicating relative longitudinal position information and a second two-bit sub-portion indicating relative lateral position information, a second two-bit portion indicating relative elevation information, such as the relative elevation information determined at 32500, a third two-bit portion indicating relative heading information, such as the relative heading information determined at 32600, or a combination thereof.

Although not shown separately in FIG. 32, in some embodiments, determining the codeword may include determining a stabilized codeword that identifies as convergent a false negative incorrectly indicating that the expected path for the remote vehicle and the expected path for the host vehicle are divergent where a difference between a remote vehicle heading angle for the remote vehicle and a reference direction is within a heading approximation offset threshold.

Although described separately for clarity, in some embodiments, two or more of the angular offset thresholds φ_(P), φ_(I), φ_(A), φ_(C), φ_(L), or φ_(R), may be equal. For example, the angular offset thresholds φ_(I) and φ_(A) may be five degrees.

Although not shown in FIG. 32, in some embodiments, determining whether the remote vehicle expected path and the host vehicle expected path are convergent may include determining a host vehicle region for the host vehicle, determining a remote vehicle region for the remote vehicle, determining a host vehicle approach angle, determining a remote vehicle approach angle determining an intersection angle, or a combination thereof, which may be similar to determining a host vehicle region for the host vehicle, determining a remote vehicle region for the remote vehicle, determining a host vehicle approach angle α_(HV), determining a remote vehicle approach angle α_(RV), and determining an intersection angle α_(D) as shown in FIGS. 6, 10, 14, and 18.

Although not shown in FIG. 32, in some embodiments, determining whether the remote vehicle expected path and the host vehicle expected path are convergent may include determining distance information. In some embodiments, determining distance information may include determining an instantaneous distance D of the geodesic as shown in FIGS. 4-30. The instantaneous distance D of the geodesic may indicate a distance between a location of the host vehicle and a location of the remote vehicle in the geospatial domain. For example, instantaneous distance D of the geodesic may be determined using Equation 3. In some embodiments, determining distance information may include determining a host vehicle intersection distance L_(HV) for the host vehicle as shown in FIGS. 4-30. The host vehicle intersection distance L_(HV) for the host vehicle may indicate a distance between a location of the host vehicle and a projected point of convergence with the remote vehicle expected path along the host vehicle expected path in the geospatial domain. In some embodiments, determining distance information may include determining a remote vehicle intersection distance L_(HV) for the remote vehicle as shown in FIGS. 4-30. The remote vehicle intersection distance L_(RV) for the remote vehicle may indicate a distance between a location of the remote vehicle and a projected point of convergence with the host vehicle expected path along the remote vehicle expected path in the geospatial domain.

In some embodiments, generating converging path information at 32000 may include determining whether to use remote vehicle information corresponding to one or more of the remote vehicles. Although not shown separately, in some embodiments, generating convergence information at 32000 may include determining whether the remote vehicle expected path and the host vehicle expected path are convergent. In some embodiments, the convergence information identified at 32000 may temporally, such as within a fraction of a second, correspond with receiving the remote vehicle information.

FIG. 33 is a diagram of passing lane collision avoidance in accordance with this disclosure. In some embodiments, passing lane collision avoidance may include determining that an expected path for the host vehicle and an expected path for a remote vehicle are convergent at a location in the vehicle transportation network corresponding to an expected passing lane maneuver for the host vehicle, such as a maneuver that includes traversing a portion of the vehicle transportation network in a current lane, entering a lane, which may be an oncoming lane, to the left of the host vehicle, to pass another vehicle, or other obstruction, ahead of the host vehicle in the current lane.

In some embodiments, passing lane collision avoidance may be implemented in a vehicle, such as the vehicle 1000 shown in FIG. 1 or the vehicles 2100/2110 shown in FIG. 2. Although not shown separately in FIG. 31 or FIG. 32, in some embodiments, generating convergence information, such as the generating convergence information as shown at 31300 in FIG. 31, or the generating convergence information as shown in FIG. 32, may include passing lane collision avoidance.

In some embodiments, passing lane collision avoidance may include generating a relative position code at 33100, generating a dynamic state code at 33200, identifying an expected passing lane collision condition at 33300, identifying a vehicle control action at 33400, performing an advisory action at 33500, performing a warning control action at 33600, or a combination thereof.

In some embodiments, a relative position code may be generated at 33100. In some embodiments, generating a relative position code may be similar to generating convergence information as shown in FIG. 32. For example, generating a relative position code may include generating a codeword, or stabilized codeword, as shown in FIG. 32 as the relative position code.

In some embodiments, a relative position code may include one or more indicators, flags, or bits. In some embodiments, a pair of bits may represent an element of the current relative position of a remote vehicle relative to the current position of the host vehicle. Although the bits of the relative position code are described herein in a particular order, any order may be used. In some embodiments, one or more pairs of bit values, such as 11, may be unused for indicating valid information and may represent invalid or erroneous information.

For example, the relative position code may include a first bit X and a second bit W, and the bits XW may represent a relative longitudinal position of the remote vehicle, as shown in Table 37 below.

TABLE 37 X W Relative Longitudinal Position 0 0 RV ahead of HV 0 1 RV adjacent to HV 1 0 RV behind HV 1 1 Unused/Error

In another example, the relative position code may include a third bit V and a fourth bit U, and the bits VU may represent a relative lateral position of the remote vehicle, as shown in Table 38 below.

TABLE 38 V U Relative Lateral Position 0 0 RV in-line with HV 0 1 RV left of HV 1 0 RV right of HV 1 1 Unused/Error

In another example, the relative position code may include a fifth bit T and a sixth bit S, and the bits TS may represent a relative elevation of the remote vehicle, as shown in Table 39 below.

TABLE 39 T S Relative Elevation 0 0 RV level with HV 0 1 RV above HV 1 0 RV below HV 1 1 Unused/Error

In another example, the relative position code may include a seventh bit R and an eighth bit Q, and the bits RQ may represent a relative heading of the remote vehicle, as shown in Table 40 below.

TABLE 40 R Q Relative Heading 0 0 RV diverging from HV 0 1 RV converging aligned with HV 1 0 RV converging opposed with HV 1 1 RV converging perpendicular to HV

In some embodiments, the relative position code (RPC) may be an eight-bit byte, and may include the eight flags, or bits, X, W, V, U, T, S, R, Q, in a defined order, such as XWVUTSRQ, wherein the X bit is the most significant bit and the Q bit is the least significant bit.

In some embodiments, a relative position code may be indicated using binary values. For example, a remote vehicle may be ahead of the host vehicle (XW=00), in a lane to the left of the host vehicle (VU=01), level with the host vehicle (TS=00), and on a heading converging with and opposing the host vehicle (RQ=10), and the relative position code may be expressed as 00010010. In some embodiments, the relative position code may be expressed using the corresponding decimal notation. For example, the relative position code expressed as 00010010 in binary notation may be expressed in decimal notation as 33.

In some embodiments, a dynamic state code may be generated at 33200. In some embodiments, a dynamic state code may indicate a current operational state of a vehicle and may be generated based on remote vehicle information identified for the vehicle. In some embodiments, generating a dynamic state code at 33200 may include generating a remote vehicle dynamic state code (RVC), a host vehicle dynamic state code (HVC), or both.

In some embodiments, a dynamic state code may include one or more indicators, flags, or bits. In some embodiments, a pair of bits may represent an element of the current dynamic state of a remote vehicle. Although the bits of the dynamic state code are described herein in a particular order, any order may be used. In some embodiments, one or more pairs of bit values, such as 11, may be unused for indicating valid information and may represent invalid or erroneous information.

For example, the dynamic state code may include a first bit, P for the remote vehicle and H for the host vehicle, and a second bit, O for the remote vehicle and G for the host vehicle, and the bits PO/HG may represent a kinetic state of the vehicle, as shown in Table 41 below.

TABLE 41 P/H O/G Kinetic State 0 0 In Motion 0 1 Stationary 1 0 Unused/Error 1 1 Unused/Error

In another example, the dynamic state code may include a third bit, N for the remote vehicle and F for the host vehicle, and a fourth bit, M for the remote vehicle and E for the host vehicle, and the bits NM/FE may represent a lateral control state, such as a steering wheel position, of the vehicle, as shown in Table 42 below.

TABLE 42 N/F M/E Lateral Control State 0 0 Steering left 0 1 Steering Neutral 1 0 Steering Right 1 1 Unused/Error

Although not shown separately, in some embodiments, generating a dynamic state code may include generating bits, such as the N/F and M/E bits, based on a yaw rate of the vehicle instead of, or in addition to, the steering wheel position.

In another example, the dynamic state code may include a fifth bit, L for the remote vehicle and D for the host vehicle, and a sixth bit, K for the remote vehicle and C for the host vehicle, and the bits LK/DC may represent a transmission state of the vehicle, as shown in Table 43 below.

TABLE 43 L/D K/C Transmission State 0 0 Drive 0 1 Reverse 1 0 Neutral 1 1 Park

In another example, the dynamic state code may include a seventh bit, J for the remote vehicle and B for the host vehicle, and an eighth bit, I for the remote vehicle and A for the host vehicle, and the bits JI/BA may represent a signal state, such as a turn signal state, of the vehicle, as shown in Table 44 below.

TABLE 44 J/B I/A Signal State 0 0 No Signal 0 1 Left Turn Signal 1 0 Right Turn Signal 1 1 Both Signals (hazards)

In some embodiments, the dynamic state code (RVC/HVC) may be an eight-bit byte, and may include the eight flags, or bits in a defined order. For example, the remote vehicle dynamic state code (RVC) may include the eight bits P, O, N, M, L, K, J, and I, as the eight-bit byte PONMLKJI, wherein the P bit is the most significant bit and the I bit is the least significant bit. In another example, the host vehicle dynamic state code (HVC) may include the eight bits H, G, F, E, D, C, B, and A, as the eight-bit byte HGFEDCBA, wherein the H bit is the most significant bit and the A bit is the least significant bit.

In some embodiments, a dynamic state code may be indicated using binary values. For example, a remote vehicle may be in motion (PO=00), with neutral steering (NM=01), in drive (LK=00), and with no active turn signal (JI=00), and the remote vehicle dynamic state code may be expressed as 00010000, in binary notation, or as 16, in decimal notation. In another example, the host vehicle may be in motion (HG=00), with neutral steering (FE=01), in drive (DC=00), and with no active turn signal (BA=00), and the remote vehicle dynamic state code may be expressed as 00010000, in binary notation, or as 16, in decimal notation.

In some embodiments, an expected passing lane collision condition may be identified at 33300. For example, the remote vehicle may be traversing the vehicle transportation network along a path similar to, but opposite, the host vehicle heading and in a lane adjacent to the host vehicle, and an expected passing lane collision condition may indicate an expected passing lane collision between the host vehicle and the remote vehicle responsive to the host vehicle traversing the vehicle transportation network by entering the lane of the remote vehicle.

In some embodiments, identifying an expected passing lane collision condition at 33300 may include evaluating the relative position code (RPC), the remote vehicle dynamic state code (RVC), the host vehicle dynamic state code (HVC), or a combination thereof. For example, the relative position code (RPC), the remote vehicle dynamic state code (RVC), and the host vehicle dynamic state code (HVC), may be combined as a three-byte word, and identifying an expected passing lane collision condition at 33300 may include evaluating the three-byte word.

In some embodiments, identifying an expected passing lane collision condition at 33300 may include identifying relative position code for passing lane collision avoidance (RPC_(DNPW)), identifying a remote vehicle dynamic state code for passing lane collision avoidance (RVC_(DNPW)), identifying a host vehicle dynamic state code for passing lane collision avoidance (HVC_(DNPW)), or a combination thereof. In some embodiments, evaluating the relative position code (RPC), the remote vehicle dynamic state code (RVC), the host vehicle dynamic state code (HVC), or a combination thereof may be expressed using Boolean Algebra notation.

In some embodiments, the relative position code for passing lane collision avoidance (RPC_(DNPW)) may be identified based on the relative position code.

In some embodiments, the remote vehicle may be ahead of the host vehicle, which may be indicated by the bits X and W having the values zero (0) and zero (0) respectively, which may be expressed as XW=00, or may be expressed in Boolean Algebra notation as not X (X) and not W (W) respectively, or in combination as X W, and an expected passing lane collision condition may be identified for a remote vehicle ahead of the host vehicle. The Boolean Algebra notation XW, which may correspond with the bit values 10, may indicate that the remote vehicle is behind the host vehicle, and a non-collision passing lane condition may be identified. The Boolean Algebra notation XW, which may correspond with the bit values 01, may indicate that the remote vehicle is adjacent to the host vehicle, and a non-collision passing lane condition may be identified. The Boolean Algebra notation XW, which may correspond with the bit values 11, may indicate a fault or error, and a non-collision passing lane condition may be identified.

In some embodiments, the remote vehicle may be to the left of the host vehicle, which may be indicated by the bits V and U having the values zero (0) and one (1) respectively, which may be expressed as VU=01, or may be expressed in Boolean Algebra notation as not V (V) and U (U) respectively, or in combination as VU. In some embodiments, an expected passing lane collision condition may be identified for a remote vehicle to the left of the host vehicle. The Boolean Algebra notation VŪ, which may correspond with the bit values 10, may indicate that the remote vehicle is in a lane to the right of the host vehicle, and a non-collision passing lane condition may be identified. The Boolean Algebra notation VŪ, which may correspond with the bit values 00, may indicate that the remote vehicle is in-line with the host vehicle, and a non-collision passing lane condition may be identified. The Boolean Algebra notation VU, which may correspond with the bit values 11, may indicate a fault or error, and a non-collision passing lane condition may be identified.

In some embodiments, the remote vehicle may be level with the host vehicle, which may be indicated by the bits T and S having the values zero (0) and zero (0) respectively, which may be expressed as TS=00, or may be expressed in Boolean Algebra notation as not T (T) and not S (S) respectively, or in combination as T S. The Boolean Algebra notation TS, which may correspond with the bit values 01, may indicate that the remote vehicle is above the host vehicle, and a non-collision passing lane condition may be identified. The Boolean Algebra notation TS, which may correspond with the bit values 10, may indicate that the remote vehicle is below the host vehicle, and a non-collision passing lane condition may be identified. The Boolean Algebra notation TS, which may correspond with the bit values 11, may indicate a fault or error, and a non-collision passing lane condition may be identified.

In some embodiments, the remote vehicle heading may be converging with and opposite to the host vehicle heading, which may be indicated by the bits R and Q having the values one (1) and zero (0) respectively, which may be expressed as RQ=10, and the relative heading of the remote vehicle (RQ) may be expressed in Boolean Algebra notation as RQ. In some embodiments, an expected passing lane collision condition may be identified for a remote vehicle converging with and opposite the host vehicle. The Boolean Algebra notation R Q, which may correspond with the bit values RQ=00, may indicate that the remote vehicle heading may be diverging from the host vehicle, and a non-collision passing lane condition may be identified. The Boolean Algebra notation RQ, which may correspond with the bit values RQ=01, may indicate that the remote vehicle heading may be converging with and aligned with the host vehicle heading, and a non-collision passing lane condition may be identified. The Boolean Algebra notation RQ, which may correspond with the bit values RQ=11, may indicate that the remote vehicle heading may be converging with and perpendicular to the host vehicle, and a non-collision passing lane condition may be identified.

In some embodiments, the remote vehicle may be an oncoming remote vehicle in a lane to the left of the host vehicle, and determining the relative position code for passing lane collision avoidance (RPC_(DNPW)) may be expressed as the following:

RPC_(DNPW) =X W ×VU×T S×RQ.  [Equation 95]

In some embodiments, the remote vehicle dynamic state code for passing lane collision avoidance (RVC_(DNPW)) may be identified based on the remote vehicle dynamic state code.

In some embodiments, the remote vehicle may be in motion, which may be indicated by the bits P and O having the values zero (0) and zero (0), which may be expressed as PO=00, and an expected passing lane collision condition may be identified for a remote vehicle in motion, which may be expressed in Boolean Algebra notation as not P (P) and not O (Ō), or in combination as PŌ. The Boolean Algebra notation PO, which may correspond with the bit values 01, may indicate that the remote vehicle is stationary, and a non-collision passing lane condition may be identified. The Boolean Algebra notation PŌ or PO, which may correspond with the bit values 10 or 11, may indicate a fault or error, and a non-collision passing lane condition may be identified.

In some embodiments, the remote vehicle may be steering to the left, which may be indicated by the bits N and M having the values zero (0) and zero (0) respectively, which may be expressed as NM=00, may be steering neutral, which may be indicated by the bits N and M having the values zero (0) and one (1) respectively, which may be expressed as NM=01, or may be steering to the right, which may be indicated by the bits N and M having the values one (1) and zero (0) respectively, which may be expressed as NM=10. An expected passing lane collision condition may be identified for a remote vehicle in steering left, neutral, or right. The Boolean Algebra notation for not NM (NM), may correspond with the bit values 11, and may indicate a fault or error, and a non-collision passing lane condition may be identified.

In some embodiments, the remote vehicle may be in drive, which may be indicated by the bits L and K having the values zero (0) and zero (0) respectively, which may be expressed as LK=00, the remote vehicle may be in neutral, which may be indicated by the bits L and K having the values one (1) and zero (0) respectively, which may be expressed as LK=10, and an expected passing lane collision condition may be identified for a remote vehicle in drive or in neutral, which may be expressed in Boolean Algebra notation as not K (K). The Boolean Algebra notation LK, which may correspond with the bit values 01, may indicate that the remote vehicle is in reverse, and a non-collision passing lane condition may be identified. The Boolean Algebra notation LK, which may correspond with the bit values 11, may indicate that the remote vehicle is in park, and a non-collision passing lane condition may be identified.

In some embodiments, the remote vehicle may not have an active external signal indicator, which may be indicated by the bits J and I having the values zero (0) and zero (0) respectively, which may be expressed as JI=00, may have an active left turn signal, which may be indicated by the bits J and I having the values zero (0) and one (1) respectively, which may be expressed as JI=01, may have an active right turn signal, which may be indicated by the bits J and I having the values one (1) and zero (0) respectively, which may be expressed as JI=10, or may have active hazards, which may be indicated by the bits J and I having the values one (1) and one (1) respectively, which may be expressed as JI=11. An expected passing lane collision condition may be identified for a remote vehicle that has no active external signal indicators, that has an active left turn signal indicator, that has an active right turn signal indicator, or that has active hazards, which may be expressed in Boolean Algebra notation as true, or 1.

In some embodiments, the remote vehicle may be an oncoming remote vehicle in a lane to the left of the host vehicle, and determining the remote vehicle dynamic state code for passing lane collision avoidance (RVC_(DNPW)) may be expressed as the following:

RVC_(DNPW) =PŌ×NM×K.  [Equation 96]

In some embodiments, the host vehicle dynamic state code for passing lane collision avoidance (HVC_(DNPW)) may be identified based on the host vehicle dynamic state code.

In some embodiments, the host vehicle may be in motion, which may be indicated by the bits H and G having the values zero (0) and zero (0), which may be expressed as HG=00, and an expected passing lane collision condition may be identified for a host vehicle in motion, which may be expressed in Boolean Algebra notation as not H (H) and not G (G), or in combination as H G. The Boolean Algebra notation HG, which may correspond with the bit values 01, may indicate that the host vehicle is stationary, and a non-collision passing lane condition may be identified. The Boolean Algebra notation HG or HG, which may correspond with the bit values 10 or 11, may indicate a fault or error, and a non-collision passing lane condition may be identified.

In some embodiments, the host vehicle may be steering to the left, which may be indicated by the bits F and E having the values zero (0) and zero (0) respectively, which may be expressed as FE=00, may be steering neutral, which may be indicated by the bits F and E having the values zero (0) and one (1) respectively, which may be expressed as FE=01, or may be steering to the right, which may be indicated by the bits F and E having the values one (1) and zero (0) respectively, which may be expressed as FE=10. An expected passing lane collision condition may be identified for a host vehicle steering left, neutral, or right. The Boolean Algebra notation for not FE (FE), may correspond with the bit values 11, and may indicate a fault or error, and a non-collision passing lane condition may be identified.

In some embodiments, the host vehicle may be in drive, which may be indicated by the bits D and C having the values zero (0) and zero (0) respectively, which may be expressed as DC=00, or the host vehicle may be in neutral, which may be indicated by the bits D and C having the values one (1) and zero (0) respectively, which may be expressed as DC=10, and an expected passing lane collision condition may be identified for a host vehicle in neutral or drive, which may be expressed in Boolean Algebra notation as not C (C). The Boolean Algebra notation DC, which may correspond with the bit values 01, may indicate that the host vehicle is in reverse, and a non-collision passing lane condition may be identified. The Boolean The Boolean Algebra notation DC, which may correspond with the bit values 11, may indicate that the host vehicle is in park, and a non-collision passing lane condition may be identified.

In some embodiments, the host vehicle may have an active left turn signal, which may be indicated by the bits B and A having the values zero (0) and one (1) respectively, which may be expressed as BA=01, which may be expressed in Boolean Algebra notation as not B (B) and A, or in combination as BA, and an expected passing lane collision condition may be identified for a host vehicle that has an active left turn signal indicator. The Boolean Algebra notation BĀ, which may correspond with the bit values 00, may indicate that the host vehicle does not have an active external signal indicator, and a non-collision passing lane condition may be identified. The Boolean Algebra notation BĀ, which may correspond with the bit values 10, may indicate that the host vehicle has an active right turn signal, and a non-collision passing lane condition may be identified. The Boolean Algebra notation BA, which may correspond with the bit values 11, may indicate that the host vehicle has a hazards signal, and a non-collision passing lane condition may be identified.

In some embodiments, determining the host vehicle dynamic state code for passing lane collision avoidance (HVC_(DNPW)) may be expressed as the following:

HVC_(DNPW) =H G×{right arrow over (FE)}×C×BA.  [Equation 97]

In some embodiments, convergence information, which may include passing lane collision avoidance information, may be generated periodically, such as according to a defined period, such as 100 milliseconds. In some embodiments, the period between generating convergence information may be extended in response to identifying an expected passing lane collision condition at 33300. For example, an expected passing lane collision condition may be identified at 33300 and the period for generating convergence information may be extended from 100 ms to 500 ms.

In some embodiments, identifying an expected passing lane collision condition at 33300 may include identifying an expected passing lane maneuver for the host vehicle. For example, a driver of the host vehicle may control the vehicle to activate a left turn signal, accelerate, steer into a passing lane, such as an oncoming lane, to the left of the current lane, or a combination thereof, to pass another vehicle, or other obstruction, ahead of the host vehicle in the current lane, and, in response, the host vehicle may identify an expected passing lane maneuver for the host vehicle. In some embodiments, an expected passing lane collision condition may be identified in response to identifying an expected passing lane maneuver for the host vehicle.

In some embodiments, identifying an expected passing lane collision condition at 33300 may include determining a geospatially direct line distance, or instantaneous distance, D between the host vehicle and the remote vehicle, which may be determined based on the host vehicle information, the remote vehicle information, or a combination thereof, as shown in Equation 3.

In some embodiments, identifying an expected passing lane collision condition at 33300 may include determining a expected time to contact (TTC), which may indicate an expected spatial or temporal period before the host vehicle comes into contact with the remote vehicle based on the distance, the host vehicle speed (v_(HV)), the remote vehicle speed (v_(RV)), or a combination thereof, and which may be expressed as the following:

$\begin{matrix} {{TTC} = {\frac{D}{\left( {v_{HV} + v_{RV}} \right)}.}} & \left\lbrack {{Equation}\mspace{14mu} 98} \right\rbrack \end{matrix}$

In some embodiments, identifying an expected passing lane collision condition at 33300 may include determining whether a time to contact threshold (TTC_(DNPW)), such as five seconds, exceeds the expected time to contact (TTC), which may be expressed as TTC<TTC_(DNPW). In some embodiments, the time to contact threshold (TTC_(DNPW)) may exceed the expected time to contact (TTC), and identifying the vehicle control action at 33400 may include determining a current acceleration rate a_(HV) for the host vehicle, and determining whether the acceleration rate for the host vehicle a_(HV) exceeds a passing maneuver acceleration rate threshold a_(DNPW), such as 0.05 g, which may be expressed as a_(HV)>a_(DNPW)In some embodiments, the acceleration rate for the host vehicle a_(HV) may exceed the passing maneuver acceleration rate threshold a_(DNPW) and an expected passing lane collision condition may be identified.

In some embodiments, a vehicle control action may be identified at 33400. In some embodiments, a vehicle control action may be identified in response to identifying an expected passing lane collision condition at 33300. In some embodiments, a vehicle control action may indicate a vehicle control operation for safely traversing a portion the vehicle transportation network corresponding to the expected passing lane collision condition, such as by remaining in a current lane or omitting a passing maneuver.

In some embodiments, a warning vehicle control action may be performed at 33500. In some embodiments, the warning vehicle control action may include presenting warning information indicating the expected passing lane collision and the vehicle control action for safely traversing the vehicle transportation network to avoid the expected passing lane collision, such as staying in a current lane, or a combination thereof, to the driver of the host vehicle.

Although not shown separately in FIG. 33, in some embodiments, passing lane collision avoidance may include determining that a previously identified passing lane collision condition has ceased. For example, an expected passing lane collision condition may be identified, the host vehicle may traverse the vehicle transportation network safely in accordance with the warning action at 33500, and passing lane collision avoidance may include determining that the previously identified passing lane collision condition has ceased. In some embodiments, a previously displayed passing lane collision avoidance may be cleared in response to determining that the previously identified passing lane collision condition has ceased.

Although not shown separately in FIG. 33, the vehicle may identify a passing lane collision avoidance state concurrently with another warning state, such as another passing lane collision avoidance state, a blind spot warning state, a rear collision warning state, or any other warning state, may determine the most immediate warning state from the identified warning states, may operate the vehicle in accordance with the most immediate warning state, and may omit operating the vehicle in accordance with the other warning states.

FIG. 34 is a logic flow diagram of the example of passing lane collision avoidance shown in FIG. 33, in accordance with this disclosure. In some embodiments passing lane collision avoidance may be implemented in a vehicle, such as the vehicle 1000 shown in FIG. 1 or the vehicles 2100/2110 shown in FIG. 2.

In some embodiments, passing lane collision avoidance may include determining whether the relative longitudinal position portion (XW) of a relative position code (RPC), such as the relative position code identified at 33100 as shown in FIG. 33, includes a fault code (XW=11; binary representation) at 34000.

In some embodiments, the relative longitudinal position portion (XW) of the relative position code (RPC) may include a non-fault code (00, 01, 10; binary representation) and passing lane collision avoidance may include determining whether the relative lateral position portion (VU) of the relative position code (RPC) includes a fault code (VU=11; binary representation) at 34010.

In some embodiments, the relative lateral position portion (VU) of the relative position code (RPC) may include a non-fault code (00, 01, 10; binary representation) and passing lane collision avoidance may include determining whether the relative elevation position portion (TS) of the relative position code (RPC) includes a fault code (TS=11; binary representation) at 34020.

In some embodiments, the relative elevation portion (VU) of the relative position code (RPC) may include a non-fault code (00, 01, 10; binary representation) and passing lane collision avoidance may include determining whether the first bit of the host vehicle motion portion (H) of a host vehicle dynamic state code (HVC), such as the host vehicle dynamic state code identified at 33200 as shown in FIG. 33, and the host vehicle lateral control portion (FE) of the host vehicle dynamic state code (HVC) includes a fault code (HFE=111; binary representation) at 34030.

In some embodiments, the first bit of the host vehicle motion portion (H) of the host vehicle dynamic state code (HVC) and the host vehicle lateral control portion (FE) of the host vehicle dynamic state code (HVC) may include a non-fault code (00, 01, 10; binary representation) and passing lane collision avoidance may include determining whether the first bit of the remote vehicle motion portion (P) of a remote vehicle dynamic state code (RVC), such as the remote vehicle dynamic state code identified at 33200 as shown in FIG. 33, and the remote vehicle lateral control portion (NM) of the remote vehicle dynamic state code (RVC) includes a fault code (PNM=111; binary representation) at 34040.

In some embodiments, the first bit of the remote vehicle motion portion (P) of the remote vehicle dynamic state code (RVC) and the remote vehicle lateral control portion (NM) of the remote vehicle dynamic state code (RVC) may include a non-fault code (000, 001, 010, 011, 100, 101, 110; binary representation) and passing lane collision avoidance may include determining whether the relative position code (RPC) indicates an expected passing lane collision condition (RPC=18; decimal representation) at 34200.

In some embodiments, the relative position code (RPC) may indicate an expected passing lane collision condition and passing lane collision avoidance may include determining whether a host vehicle dynamic state code for passing lane collision warning (HVC_(DNPW)), such as the host vehicle dynamic state code for passing lane collision warning identified at 33300 as shown in FIG. 33, indicates an expected passing lane collision condition (HVC_(DNPW)=1) at 34300.

In some embodiments, host vehicle dynamic state code for passing lane collision warning (HVC_(DNPW)) may indicate an expected passing lane collision condition and passing lane collision avoidance may include determining whether a remote vehicle dynamic state code for passing lane collision warning (RVC_(DNPW)), such as the remote vehicle dynamic state code for passing lane collision warning identified at 33300 as shown in FIG. 33, indicates an expected passing lane collision condition (RVC_(DNPW)=1) at 34400.

In some embodiments, remote vehicle dynamic state code for passing lane collision warning (RVC_(DNPW)) may indicate an expected passing lane collision condition, passing lane collision avoidance may include determining an instantaneous distance D, a expected time to contact (TTC), or both, at 34500, such as the TTC identified at 33400 as shown in FIG. 33, and passing lane collision avoidance may include determining whether a time to contact threshold (TTC_(DNPW)), such as five seconds, exceeds the time to contact (TTC<TTC_(DNPW)) at 34600.

In some embodiments, the time to contact TTC may be less than the time to contact threshold TTC_(DNPW) and passing lane collision avoidance may include determining an acceleration rate a_(HV) for the host vehicle, and determining whether the acceleration rate for the host vehicle a_(HV) exceeds a passing maneuver acceleration rate threshold a_(DNPW), such as 0.05 g, which may be expressed as a_(HV)>a_(DNPW) at 34700.

In some embodiments, the acceleration rate for the host vehicle a_(HV) may exceed the passing maneuver acceleration rate threshold a_(DNPW) and traversing the vehicle transportation network in accordance with a warning vehicle control action at 34800, such as the warning vehicle control action identified at 33500 in FIG. 33, such as remaining in a current lane or omitting a passing maneuver.

FIG. 35 is a diagram of blind spot collision avoidance in accordance with this disclosure. In some embodiments, blind spot collision avoidance may be implemented in a vehicle, such as the vehicle 1000 shown in FIG. 1 or the vehicles 2100/2110 shown in FIG. 2. Although not shown separately in FIG. 31 or FIG. 32, in some embodiments, generating convergence information, such as the generating convergence information as shown at 31300 in FIG. 31, or the generating convergence information as shown in FIG. 32, may include blind spot collision avoidance.

In some embodiments, blind spot collision avoidance may include generating a relative position code at 35100, generating a dynamic state code at 35200, identifying an expected blind spot collision condition at 35300, identifying a vehicle control action at 35400, performing an advisory action at 35500, performing a warning control action at 35600, or a combination thereof.

In some embodiments, a relative position code may be generated at 35100. In some embodiments, generating a relative position code may be similar to generating convergence information as shown in FIG. 32. For example, generating a relative position code may include generating a codeword, or stabilized codeword, as shown in FIG. 32 as the relative position code.

In some embodiments, a relative position code may include one or more indicators, flags, or bits. In some embodiments, a pair of bits may represent an element of the current relative position of a remote vehicle relative to the current position of the host vehicle. Although the bits of the relative position code are described herein in a particular order, any order may be used. In some embodiments, one or more pairs of bit values, such as 11, may be unused for indicating valid information and may represent invalid or erroneous information.

For example, the relative position code may include a first bit X and a second bit W, and the bits XW may represent a relative longitudinal position of the remote vehicle, as shown in Table 45 below.

TABLE 45 X W Relative Longitudinal Position 0 0 RV ahead of HV 0 1 RV adjacent to HV 1 0 RV behind HV 1 1 Unused/Error

In another example, the relative position code may include a third bit V and a fourth bit U, and the bits VU may represent a relative lateral position of the remote vehicle, as shown in Table 46 below.

TABLE 46 V U Relative Lateral Position 0 0 RV in-line with HV 0 1 RV left of HV 1 0 RV right of HV 1 1 Unused/Error

In another example, the relative position code may include a fifth bit T and a sixth bit S, and the bits TS may represent a relative elevation of the remote vehicle, as shown in Table 47 below.

TABLE 47 T S Relative Elevation 0 0 RV level with HV 0 1 RV above HV 1 0 RV below HV 1 1 Unused/Error

In another example, the relative position code may include a seventh bit R and an eighth bit Q, and the bits RQ may represent a relative heading of the remote vehicle, as shown in Table 48 below.

TABLE 48 R Q Relative Heading 0 0 RV diverging from HV 0 1 RV converging aligned with HV 1 0 RV converging opposed with HV 1 1 RV converging perpendicular to HV

In some embodiments, the relative position code (RPC) may be an eight-bit byte, and may include the eight flags, or bits, X, W, V, U, T, S, R, Q, in a defined order, such as XWVUTSRQ, wherein the X bit is the most significant bit and the Q bit is the least significant bit.

In some embodiments, a relative position code may be indicated using binary values. For example, a remote vehicle may be behind the host vehicle (XW=10), in a lane to the left of the host vehicle (VU=01), level with the host vehicle (TS=00), and on a heading converging with and in alignment with the host vehicle (RQ=01), and the relative position code may be expressed as 10010001. In some embodiments, the relative position code may be expressed using the corresponding decimal notation. For example, the relative position code expressed as 10010001 in binary notation may be expressed in decimal notation as 145. In another example, a remote vehicle may be adjacent to the host vehicle (XW=01), in a lane to the left of the host vehicle (VU=01), level with the host vehicle (TS=00), and on a heading converging with and in alignment with the host vehicle (RQ=01), and the relative position code may be expressed as 01010001 in binary notation and may be expressed in decimal notation as 81. In another example, a remote vehicle may be behind the host vehicle (XW=10), in a lane to the right of the host vehicle (VU=10), level with the host vehicle (TS=00), and on a heading converging with and in alignment with the host vehicle (RQ=01), and the relative position code may be expressed as 10100001 in binary notation and may be expressed in decimal notation as 161. In another example, a remote vehicle may be adjacent to the host vehicle (XW=01), in a lane to the right of the host vehicle (VU=10), level with the host vehicle (TS=00), and on a heading converging with and in alignment with the host vehicle (RQ=01), and the relative position code may be expressed as 01100001 in binary notation and may be expressed in decimal notation as 97.

In some embodiments, a dynamic state code may be generated at 35200. In some embodiments, a dynamic state code may indicate a current operational state of a vehicle and may be generated based on remote vehicle information identified for the vehicle. In some embodiments, generating a dynamic state code at 35200 may include generating a remote vehicle dynamic state code (RVC), a host vehicle dynamic state code (HVC), or both.

In some embodiments, a dynamic state code may include one or more indicators, flags, or bits. In some embodiments, a pair of bits may represent an element of the current dynamic state of a remote vehicle. Although the bits of the dynamic state code are described herein in a particular order, any order may be used. In some embodiments, one or more pairs of bit values, such as 11, may be unused for indicating valid information and may represent invalid or erroneous information.

For example, the dynamic state code may include a first bit, P for the remote vehicle and H for the host vehicle, and a second bit, O for the remote vehicle and G for the host vehicle, and the bits PO/HG may represent a kinetic state of the vehicle, as shown in Table 49 below.

TABLE 49 P/H O/G Kinetic State 0 0 In Motion 0 1 Stationary 1 0 Unused/Error 1 1 Unused/Error

In another example, the dynamic state code may include a third bit, N for the remote vehicle and F for the host vehicle, and a fourth bit, M for the remote vehicle and E for the host vehicle, and the bits NM/FE may represent a lateral control state, such as a steering wheel position, of the vehicle, as shown in Table 50 below.

TABLE 50 N/F M/E Lateral Control State 0 0 Steering left 0 1 Steering Neutral 1 0 Steering Right 1 1 Unused/Error

Although not shown separately, in some embodiments, generating a dynamic state code may include generating bits, such as the N/F and M/E bits, based on a yaw rate of the vehicle instead of, or in addition to, the steering wheel position.

In another example, the dynamic state code may include a fifth bit, L for the remote vehicle and D for the host vehicle, and a sixth bit, K for the remote vehicle and C for the host vehicle, and the bits LK/DC may represent a transmission state of the vehicle, as shown in Table 51 below.

TABLE 51 L/D K/C Transmission State 0 0 Drive 0 1 Reverse 1 0 Neutral 1 1 Park

In another example, the dynamic state code may include a seventh bit, J for the remote vehicle and B for the host vehicle, and an eighth bit, I for the remote vehicle and A for the host vehicle, and the bits JI/BA may represent a signal state, such as a turn signal state, of the vehicle, as shown in Table 52 below.

TABLE 52 J/B I/A Signal State 0 0 No Signal 0 1 Left Turn Signal 1 0 Right Turn Signal 1 1 Both Signals (hazards)

In some embodiments, the dynamic state code (RVC/HVC) may be an eight-bit byte, and may include the eight flags, or bits in a defined order. For example, the remote vehicle dynamic state code (RVC) may include the eight bits P, O, N, M, L, K, J, and I, as the eight-bit byte PONMLKJI, wherein the P bit is the most significant bit and the I bit is the least significant bit. In another example, the host vehicle dynamic state code (HVC) may include the eight bits H, G, F, E, D, C, B, and A, as the eight-bit byte HGFEDCBA, wherein the H bit is the most significant bit and the A bit is the least significant bit.

In some embodiments, a dynamic state code may be indicated using binary values. For example, a remote vehicle may be in motion (PO=00), with neutral steering (NM=01), in drive (LK=00), and with no active turn signal (JI=00), and the remote vehicle dynamic state code may be expressed as 00010000, in binary notation, or as 16, in decimal notation. In another example, the host vehicle may be in motion (HG=00), with neutral steering (FE=01), in drive (DC=00), and with no active turn signal (BA=00), and the remote vehicle dynamic state code may be expressed as 00010000, in binary notation, or as 16, in decimal notation. In another example, the host vehicle may be in motion (HG=00), with neutral steering (FE=01), in drive (DC=00), and with an active left turn signal (BA=01), and the remote vehicle dynamic state code may be expressed as 00010001, in binary notation, or as 17, in decimal notation. In another example, the host vehicle may be in motion (HG=00), with neutral steering (FE=01), in drive (DC=00), and with an active right turn signal (BA=10), and the remote vehicle dynamic state code may be expressed as 00010010, in binary notation, or as 18, in decimal notation.

In some embodiments, an expected blind spot collision condition may be identified at 35300. For example, the remote vehicle may be traversing the vehicle transportation network along a path similar to the host vehicle and in a lane adjacent to the host vehicle, and an expected blind spot collision condition may indicate an expected blind spot collision between the host vehicle and the remote vehicle responsive to the host vehicle traversing the vehicle transportation network by entering the lane of the remote vehicle.

In some embodiments, identifying an expected blind spot collision condition at 35300 may include evaluating the relative position code (RPC), the remote vehicle dynamic state code (RVC), the host vehicle dynamic state code (HVC), or a combination thereof. For example, the relative position code (RPC), the remote vehicle dynamic state code (RVC), and the host vehicle dynamic state code (HVC), may be combined as a three-byte word, and identifying an expected blind spot collision condition at 35300 may include evaluating the three-byte word.

In some embodiments, identifying an expected blind spot collision condition at 35300 may include identifying relative position code for left blind spot collision warning (RPC_(BSWL)), identifying relative position code for right blind spot collision warning (RPC_(BSWR)), identifying a remote vehicle dynamic state code for left blind spot collision warning (RVC_(BSWL)), identifying a remote vehicle dynamic state code for right blind spot collision warning (RVC_(BSWR)), identifying a host vehicle dynamic state code for left blind spot collision warning (HVC_(BSWL)), identifying a host vehicle dynamic state code for right blind spot collision warning (HVC_(BSWR)), or a combination thereof. In some embodiments, evaluating the relative position code (RPC), the remote vehicle dynamic state code (RVC), the host vehicle dynamic state code (HVC), or a combination thereof may be expressed using Boolean Algebra notation.

In some embodiments, the relative position code for left blind spot collision warning (RPC_(BSWL)), the relative position code for right blind spot collision warning (RPC_(BSWR)), or both, may be identified based on the relative position code.

In some embodiments, the remote vehicle may be behind the host vehicle, which may be indicated by the bits X and W having the values one (1) and zero (0) respectively, which may be expressed as XW=10, or may be expressed in Boolean Algebra notation as not X (X) and W (W) respectively, or in combination as XW. In some embodiments, the remote vehicle may be adjacent to the host vehicle, which may be indicated by the bits X and W having the values zero (0) and one (1) respectively, which may be expressed as XW=10, or may be expressed in Boolean Algebra notation as X (X) and not W (W) respectively, or in combination as XW. In combination, the remote vehicle longitudinal relative position corresponding to an expected blind spot collision condition may be expressed as XW+XW. The Boolean Algebra notation X W, which may correspond with the bit values 00, may indicate that the remote vehicle is ahead of the host vehicle, and a non-blind spot collision condition may be identified. The Boolean Algebra notation XW, which may correspond with the bit values 11, may indicate a fault or error, and a non-blind spot collision condition may be identified.

In some embodiments, the remote vehicle may be to the left of the host vehicle, which may be indicated by the bits V and U having the values zero (0) and one (1) respectively, which may be expressed as VU=01, or may be expressed in Boolean Algebra notation as not V (V) and U (U) respectively, or in combination as VU. In some embodiments, the remote vehicle may be to the right of the host vehicle, which may be indicated by the bits V and U having the values one (1) and zero (0) respectively, which may be expressed as VU=10, or may be expressed in Boolean Algebra notation as V (V) and not U (Ū) respectively, or in combination as VŪ. In combination, the remote vehicle lateral relative position corresponding to an expected blind spot collision condition may be expressed as VU+VŪ. The Boolean Algebra notation VŪ, which may correspond with the bit values 00, may indicate that the remote vehicle is in-lane with the host vehicle, and a non-blind spot collision condition may be identified. The Boolean Algebra notation VU, which may correspond with the bit values 11, may indicate a fault or error, and a non-blind spot collision condition may be identified.

In some embodiments, the remote vehicle may be level with the host vehicle, which may be indicated by the bits T and S having the values zero (0) and zero (0) respectively, which may be expressed as TS=00, or may be expressed in Boolean Algebra notation as not T (T) and not S (S) respectively, or in combination as T S. The Boolean Algebra notation TS, which may correspond with the bit values 01, may indicate that the remote vehicle is above the host vehicle, and a non-blind spot collision condition may be identified. The Boolean Algebra notation TS, which may correspond with the bit values 10, may indicate that the remote vehicle is below the host vehicle, and a non-blind spot collision condition may be identified. The Boolean Algebra notation TS, which may correspond with the bit values 11, may indicate a fault or error, and a non-blind spot collision condition may be identified.

In some embodiments, the remote vehicle heading may be converging with and aligned with the host vehicle heading, which may be indicated by the bits R and Q having the values zero (0) and one (1) respectively, which may be expressed as RQ=01, and the relative heading of the remote vehicle (RQ) may be expressed in Boolean Algebra notation as RQ, and an expected blind spot collision condition may be identified. The Boolean Algebra notation R Q, which may correspond with the bit values RQ=00, may indicate that the remote vehicle heading may be diverging from the host vehicle, and a non-blind spot collision condition may be identified. The Boolean Algebra notation RQ, which may correspond with the bit values RQ=10, may indicate that the remote vehicle heading may be converging with and opposing the host vehicle, and a non-blind spot collision condition may be identified. The Boolean Algebra notation RQ, which may correspond with the bit values RQ=11, may indicate that the remote vehicle heading may be converging with and perpendicular to the host vehicle, and a non-blind spot collision condition may be identified.

In some embodiments, determining the relative position code for left blind spot collision warning (RPC_(BSWL)) may be expressed as the following:

RPC_(BSWL)=( XW+XW )× VU×T S×RQ.   [Equation 99]

In some embodiments, determining the relative position code for right blind spot collision warning (RPC_(BSWR)) may be expressed as the following:

RPC_(BSWR)=( XW+XW )×VŪ×T S RQ.   [Equation 100]

In some embodiments, the remote vehicle dynamic state code for left blind spot collision warning (RVC_(BSWL)), the remote vehicle dynamic state code for right blind spot collision warning (RVC_(BSWR)), or both, may be identified based on the remote vehicle dynamic state code.

In some embodiments, the remote vehicle may be in motion, which may be indicated by the bits P and O having the values zero (0) and zero (0), which may be expressed as PO=00, and an expected blind spot collision condition may be identified for a remote vehicle in motion, which may be expressed in Boolean Algebra notation as not P (P) and not O (Ō), or in combination as PŌ. The Boolean Algebra notation √{square root over (P)}O, which may correspond with the bit values 01, may indicate that the remote vehicle is stationary, and a non-blind spot collision condition may be identified. The Boolean Algebra notation PŌ or PO, which may correspond with the bit values 10 or 11, may indicate a fault or error, and a non-blind spot collision condition may be identified.

In some embodiments, the remote vehicle may be steering to the left, which may be indicated by the bits N and M having the values zero (0) and zero (0) respectively, which may be expressed as NM=00, may be steering neutral, which may be indicated by the bits N and M having the values zero (0) and one (1) respectively, which may be expressed as NM=01, or may be steering to the right, which may be indicated by the bits N and M having the values one (1) and zero (0) respectively, which may be expressed as NM=10. An expected blind spot collision condition may be identified for a remote vehicle in steering left, neutral, or right. The Boolean Algebra notation for not NM (NM), may correspond with the bit values 11, and may indicate a fault or error, and a non-blind spot collision condition may be identified.

In some embodiments, the remote vehicle may be in drive, which may be indicated by the bits L and K having the values zero (0) and zero (0) respectively, which may be expressed as LK=00, and an expected blind spot collision condition may be identified for a remote vehicle in drive, which may be expressed in Boolean Algebra notation as not L (L) and not K (K), or in combination as L K. The Boolean Algebra notation LK, which may correspond with the bit values 01, may indicate that the remote vehicle is in reverse, and a non-blind spot collision condition may be identified. The Boolean Algebra notation LK, which may correspond with the bit values 10, may indicate that the remote vehicle is in neutral, and a non-blind spot collision condition may be identified. The Boolean Algebra notation LK, which may correspond with the bit values 11, may indicate that the remote vehicle is in park, and a non-blind spot collision condition may be identified.

In some embodiments, the remote vehicle may not have an active external signal indicator, which may be indicated by the bits J and I having the values zero (0) and zero (0) respectively, which may be expressed as JI=00, may have an active left turn signal, which may be indicated by the bits J and I having the values zero (0) and one (1) respectively, which may be expressed as JI=01, may have an active right turn signal, which may be indicated by the bits J and I having the values one (1) and zero (0) respectively, which may be expressed as JI=10, or may have active hazards, which may be indicated by the bits J and I having the values one (1) and one (1) respectively, which may be expressed as JI=11. An expected blind spot collision condition may be identified for a remote vehicle that has no active external signal indicators, that has an active left turn signal indicator, that has an active right turn signal indicator, or that has active hazards, which may be expressed in Boolean Algebra notation as true, or 1.

In some embodiments, determining the remote vehicle dynamic state code for left blind spot collision warning (RVC_(BSWL)) may be expressed as the following:

RVC_(BSWL) =PŌ×NM×L K.   [Equation 101]

In some embodiments, determining the remote vehicle dynamic state code for right blind spot collision warning (RVC_(BSWR)) may be expressed as the following:

RVC_(BSWR) =PŌ×NM×L K.   [Equation 102]

In some embodiments, the host vehicle dynamic state code for left blind spot collision warning (HVC_(BSWL)), the host vehicle dynamic state code for right blind spot collision warning (HVC_(BSWR)), or both, may be identified based on the host vehicle dynamic state code.

In some embodiments, the host vehicle may be in motion, which may be indicated by the bits H and G having the values zero (0) and zero (0), which may be expressed as HG=00, and an expected blind spot collision condition may be identified for a host vehicle in motion, which may be expressed in Boolean Algebra notation as not H (H) and not G (G), or in combination as H G. The Boolean Algebra notation HG, which may correspond with the bit values 01, may indicate that the host vehicle is stationary, and a non-blind spot collision condition may be identified. The Boolean Algebra notation HG or HG, which may correspond with the bit values 10 or 11, may indicate a fault or error, and a non-blind spot collision condition may be identified.

In some embodiments, the host vehicle may be steering to the left, which may be indicated by the bits F and E having the values zero (0) and zero (0) respectively, which may be expressed as FE=00, may be steering neutral, which may be indicated by the bits F and E having the values zero (0) and one (1) respectively, which may be expressed as FE=01, or may be steering to the right, which may be indicated by the bits F and E having the values one (1) and zero (0) respectively, which may be expressed as FE=10. An expected blind spot collision condition may be identified for a host vehicle steering left, neutral, or right. The Boolean Algebra notation for not FE (FE), may correspond with the bit values 11, and may indicate a fault or error, and a non-blind spot collision condition may be identified.

In some embodiments, the host vehicle may be in drive, which may be indicated by the bits D and C having the values zero (0) and zero (0) respectively, which may be expressed as DC=00, or the host vehicle may be in neutral, which may be indicated by the bits D and C having the values one (1) and zero (0) respectively, which may be expressed as DC=10, and an expected blind spot collision condition may be identified for a host vehicle in neutral or drive, which may be expressed in Boolean Algebra notation as not C (C). The Boolean Algebra notation DC, which may correspond with the bit values 01, may indicate that the host vehicle is in reverse, and a non-blind spot collision condition may be identified. The Boolean The Boolean Algebra notation DC, which may correspond with the bit values 11, may indicate that the host vehicle is in park, and a non-blind spot collision condition may be identified.

In some embodiments, the host vehicle may not have an active external signal indicator, which may be indicated by the bits B and A having the values zero (0) and zero (0) respectively, which may be expressed as BA=00, may have an active left turn signal, which may be indicated by the bits B and A having the values zero (0) and one (1) respectively, which may be expressed as BA=01, may have an active right turn signal, which may be indicated by the bits B and A having the values one (1) and zero (0) respectively, which may be expressed as BA=10, or may have active hazards, which may be indicated by the bits B and A having the values one (1) and one (1) respectively, which may be expressed as BA=11. An expected blind spot collision condition may be identified for a host vehicle that has no active external signal indicators, that has an active left turn signal indicator, that has an active right turn signal indicator, or that has active hazards, which may be expressed in Boolean Algebra notation as true, or 1.

In some embodiments, the left turn signal for the host vehicle may be inactive and determining the host vehicle dynamic state code for left blind spot collision warning (HVC_(BSWL)) may be expressed as the following:

HVC_(BSWL) =H G×FE×C ×( BĀ+BA).   [Equation 103]

In some embodiments, the left turn signal for the host vehicle may be active and determining the host vehicle dynamic state code for left blind spot collision warning (HVC_(BSWL)) may be expressed as the following:

HVC_(BSWL) =H G×FE×C×BA).   [Equation 104]

In some embodiments, the right turn signal for the host vehicle may be inactive and determining the host vehicle dynamic state code for right blind spot collision warning (HVC_(BSWR)) may be expressed as the following:

HVC_(BSWR) =H G×FE×C ×( BĀ+BA).   [Equation 105]

In some embodiments, the right turn signal for the host vehicle may be active and determining the host vehicle dynamic state code for right blind spot collision warning (HVC_(BSWR)) may be expressed as the following:

HVC_(BSWR) =H G×FE×C×(BĀ).   [Equation 106]

In some embodiments, convergence information, which may include blind spot collision avoidance information, may be generated periodically, such as according to a defined period, such as 100 milliseconds. In some embodiments, the period between generating convergence information may be extended in response to identifying an expected blind spot collision condition at 35300. For example, an expected blind spot collision condition may be identified at 35300 and the period for generating convergence information may be extended from 100 ms to 500 ms.

In some embodiments, a vehicle control action may be identified at 35400. In some embodiments, a vehicle control action may be identified in response to identifying an expected blind spot collision condition at 35300. In some embodiments, a vehicle control action may indicate a vehicle control operation for safely traversing a portion the vehicle transportation network corresponding to the expected blind spot collision condition, such as by breaking to avoid a collision.

In some embodiments, identifying the vehicle control action at 35400 may include determining a geospatially direct line distance, or instantaneous distance, D between the host vehicle and the remote vehicle, which may be determined based on the host vehicle information, the remote vehicle information, or a combination thereof, as shown in Equation 3.

In some embodiments, identifying the vehicle control action at 35400 may include determining a relative longitudinal distance (d_(θ)) between the remote vehicle and the host vehicle, a relative lateral distance (d_(φ)) between the remote vehicle and the host vehicle, or both. In some embodiments, the relative longitudinal distance (d_(θ)) and the relative lateral distance (d_(φ)) may be determined based on a relative convergence angle λ. In some embodiments, determining the relative longitudinal distance (d_(θ)) based on the relative convergence angle λ may be expressed as d_(θ)=D cos(λ). In some embodiments, determining the relative lateral distance (d_(φ)) based on the relative convergence angle λ may be expressed as d_(φ)=D sin(Δ).

In some embodiments, identifying the vehicle control action at 35400 may include determining the relative convergence angle λ. In some embodiments, the relative convergence angle λ may be determined based on the convergence angle β₁, which may be determined as shown in Equation 2, and the orientation sector.

In some embodiments, the orientation sector may be the first orientation sector Q₁, which may be identified as shown in Equation 1, and determining the relative convergence angle λ may be expressed as the following:

$\begin{matrix} {\lambda_{1} = {\frac{Q_{1}}{2}\left\lbrack {{\left\lbrack {\frac{\delta_{HV} - \left( {\beta_{1} + \pi} \right) - \sigma}{{{\delta_{HV} - \left( {\beta_{1} + \pi} \right)}} + \sigma} + 1} \right\rbrack \left( {\delta_{HV} - \left( {\beta_{1} + \pi} \right)} \right)} + {\left. \quad{\left\lbrack {\frac{\left( {\beta_{1} + \pi} \right) - \delta_{HV} - \sigma}{{{\left( {\beta_{1} + \pi} \right) - \delta_{HV}}} + \sigma} + 1} \right\rbrack \left( {\left( {\beta_{1} + \pi} \right) - \delta_{HV}} \right)} \right\rbrack.}} \right.}} & \left\lbrack {{Equation}\mspace{14mu} 107} \right\rbrack \end{matrix}$

In some embodiments, the orientation sector may be the second orientation sector Q₂, which may be identified as shown in Equation 12, and determining the relative convergence angle λ may be expressed as the following:

$\begin{matrix} {\lambda_{2} = {\frac{Q_{2}}{2}\left\lbrack {{\left\lbrack {\frac{\delta_{HV} + \pi - \beta_{1} - \sigma}{{{\delta_{HV} + \pi - \beta_{1}}} + \sigma} + 1} \right\rbrack \left( {\delta_{HV} + \pi - \beta_{1}} \right)} + {\left. \quad{\left\lbrack {\frac{\beta_{1} - \left( {\delta_{HV} + \pi} \right) - \sigma}{{{\beta_{1} - \left( {\delta_{HV} + \pi} \right)}} + \sigma} + 1} \right\rbrack \left( {\beta_{1} - \left( {\delta_{HV} + \pi} \right)} \right)} \right\rbrack.}} \right.}} & \left\lbrack {{Equation}\mspace{14mu} 108} \right\rbrack \end{matrix}$

In some embodiments, the orientation sector may be the third orientation sector Q₃, which may be identified as shown in Equation 19, and determining the relative convergence angle λ may be expressed as the following:

$\begin{matrix} {\lambda_{3} = {\frac{Q_{3}}{2}\left\lbrack {{\left\lbrack {\frac{\delta_{HV} + \pi - \beta_{1} - \sigma}{{{\delta_{HV} + \pi - \beta_{1}}} + \sigma} + 1} \right\rbrack \left( {\delta_{HV} + \pi - \beta_{1}} \right)} + {\left. \quad{\left\lbrack {\frac{\beta_{1} - \left( {\delta_{HV} + \pi} \right) - \sigma}{{{\beta_{1} - \left( {\delta_{HV} + \pi} \right)}} + \sigma} + 1} \right\rbrack \left( {\beta_{1} - \left( {\delta_{HV} + \pi} \right)} \right)} \right\rbrack.}} \right.}} & \left\lbrack {{Equation}\mspace{14mu} 109} \right\rbrack \end{matrix}$

In some embodiments, the orientation sector may be the fourth orientation sector Q₄, which may be identified as shown in Equation 26, and determining the relative convergence angle λ may be expressed as the following:

$\begin{matrix} {\lambda_{4} = {\frac{Q_{4}}{2}\left\lbrack {{\left\lbrack {\frac{\delta_{HV} - \left( {\beta_{1} + \pi} \right) - \sigma}{{{\delta_{HV} - \left( {\beta_{1} + \pi} \right)}} + \sigma} + 1} \right\rbrack \left( {\delta_{HV} - \left( {\beta_{1} + \pi} \right)} \right)} + {\left. \quad{\left\lbrack {\frac{\left( {\beta_{1} + \pi} \right) - \delta_{HV} - \sigma}{{{\left( {\beta_{1} + \pi} \right) - \delta_{HV}}} + \sigma} + 1} \right\rbrack \left( {\left( {\beta_{1} + \pi} \right) - \delta_{HV}} \right)} \right\rbrack.}} \right.}} & \left\lbrack {{Equation}\mspace{14mu} 110} \right\rbrack \end{matrix}$

In combination, determining the relative convergence angle λ may be expressed as the following:

$\begin{matrix} {\lambda = {\sum\limits_{i = 1}^{4}{\lambda_{i}.}}} & \left\lbrack {{Equation}\mspace{14mu} 111} \right\rbrack \end{matrix}$

In some embodiments, identifying the vehicle control action at 35400 may include determining whether a maximum relative lateral distance (d_(φmax)), such as 7.2 meters, is greater than the relative lateral distance (d_(φ)), the relative lateral distance (d_(φ)) is at least a minimum relative lateral distance (d_(φmin)), such as 3.6 meters, or both, which may be expressed as d_(φmin)≦d_(φ)<d_(φmax). In some embodiments, the maximum relative lateral distance (d_(φmax)), the minimum relative lateral distance (d_(φmin)), or both, may be defined values.

In some embodiments, identifying the vehicle control action at 35400 may include determining whether the relative longitudinal distance (d_(θ)) is greater than a maximum relative longitudinal distance (d_(θmax)), such as three meters, the relative longitudinal distance (d_(θ)) is within a minimum relative longitudinal distance (d_(θmin)), such as ten meters, or both, which may be expressed as d_(φmin)<d_(θ)≦d_(θmax). In some embodiments, maximum relative longitudinal distance (d_(θmax)), the minimum relative longitudinal distance (d_(θmin)), or both, may be defined values. In some embodiments, maximum relative longitudinal distance (d_(θmax)), the minimum relative longitudinal distance (d_(θmin)), or both, may be determined based on, for example, the difference between the relative speed of the remote vehicle and relative speed of the host vehicle.

In some embodiments, an advisory vehicle control action may be performed at 35500. In some embodiments, the advisory vehicle control action may include presenting advisory information indicating the expected blind spot collision, the vehicle control action for safely traversing the vehicle transportation network to avoid the expected blind spot collision, such as staying in a current lane, or a combination thereof, to the driver of the host vehicle.

For example, the relative position code for left blind spot collision warning (RPC_(BSWL)) may indicate that the remote vehicle is behind or adjacent to the host vehicle, in a lane to the left of the host vehicle, level with the host vehicle, the remote vehicle heading is converging with and aligned with the host vehicle; the remote vehicle dynamic state code for left blind spot collision warning (RVC_(BSWL)) may indicate that the remote vehicle is in motion and in drive; the host vehicle dynamic state code for left blind spot collision warning (HVC_(BSWL)) may indicate that the host vehicle is in motion, in drive or neutral, the left turn signal for the host vehicle is inactive; the maximum relative lateral distance (d_(φmax)) may be greater than the relative lateral distance (d_(φ)), the relative lateral distance (d_(φ)) may be at least the minimum relative lateral distance (d_(φmin)); the relative longitudinal distance (d_(θ)) may be greater than the maximum relative longitudinal distance (d_(θmax)), the relative longitudinal distance (d_(θ)) may be within the minimum relative longitudinal distance (d_(θmin)); and an advisory vehicle control action may be identified as the vehicle control action.

In another example, the relative position code for right blind spot collision warning (RPC_(BSWR)) may indicate that the remote vehicle is behind or adjacent to the host vehicle, in a lane to the right of the host vehicle, level with the host vehicle, the remote vehicle heading is converging with and aligned with the host vehicle; the remote vehicle dynamic state code for right blind spot collision warning (RVC_(BSWR)) may indicate that the remote vehicle is in motion and in drive; the host vehicle dynamic state code for right blind spot collision warning (HVC_(BSWR)) may indicate that the host vehicle is in motion, in drive or neutral, the right turn signal for the host vehicle is inactive; the maximum relative lateral distance (d_(φmax)) may be greater than the relative lateral distance (d_(φ)), the relative lateral distance (d_(φ)) may be at least the minimum relative lateral distance (d_(φmin)); the relative longitudinal distance (d_(θ)) may be greater than the maximum relative longitudinal distance (d_(θmax)), the relative longitudinal distance (d_(θ)) may be within the minimum relative longitudinal distance (d_(θmin)); and an advisory vehicle control action may be identified as the vehicle control action.

In some embodiments, a warning vehicle control action may be performed at 35500. In some embodiments, the warning vehicle control action may include presenting warning information indicating the expected blind spot collision and the vehicle control action for safely traversing the vehicle transportation network to avoid the expected blind spot collision, such as staying in a current lane, or a combination thereof, to the driver of the host vehicle.

For example, the relative position code for left blind spot collision warning (RPC_(BSWL)) may indicate that the remote vehicle is behind or adjacent to the host vehicle, in a lane to the left of the host vehicle, level with the host vehicle, the remote vehicle heading is converging with and aligned with the host vehicle; the remote vehicle dynamic state code for left blind spot collision warning (RVC_(BSWL)) may indicate that the remote vehicle is in motion and in drive; the host vehicle dynamic state code for left blind spot collision warning (HVC_(BSWL)) may indicate that the host vehicle is in motion, in drive or neutral, the left turn signal for the host vehicle is active; the maximum relative lateral distance (d_(φmax)) may be greater than the relative lateral distance (d_(φ)), the relative lateral distance (d_(φ)) may be at least the minimum relative lateral distance (d_(φmin)); the relative longitudinal distance (d_(θ)) may be greater than the maximum relative longitudinal distance (d_(θmax)), the relative longitudinal distance (d_(θ)) may be within the minimum relative longitudinal distance (d_(θmin)); and a warning vehicle control action may be identified as the vehicle control action.

In another example, the relative position code for right blind spot collision warning (RPC_(BSWR)) may indicate that the remote vehicle is behind or adjacent to the host vehicle, in a lane to the right of the host vehicle, level with the host vehicle, the remote vehicle heading is converging with and aligned with the host vehicle; the remote vehicle dynamic state code for right blind spot collision warning (RVC_(BSWR)) may indicate that the remote vehicle is in motion and in drive; the host vehicle dynamic state code for right blind spot collision warning (HVC_(BSWR)) may indicate that the host vehicle is in motion, in drive or neutral, the right turn signal for the host vehicle is active; the maximum relative lateral distance (d_(φmax)) may be greater than the relative lateral distance (d_(φ)), the relative lateral distance (d_(φ)) may be at least the minimum relative lateral distance (d_(φmin)); the relative longitudinal distance (d_(θ)) may be greater than the maximum relative longitudinal distance (d_(θmax)), the relative longitudinal distance (d_(θ)) may be within the minimum relative longitudinal distance (d_(θmin)); and an advisory vehicle control action may be identified as the vehicle control action.

Although not shown separately in FIG. 35, in some embodiments, blind spot collision avoidance may include determining that a previously identified blind spot collision condition has ceased. For example, an expected blind spot collision condition may be identified, the host vehicle may traverse the vehicle transportation network safely in accordance with the advisory action at 35500 or the warning action at 35600, the speed of the host vehicle relative to the remote vehicle may be zero, and blind spot collision avoidance may include determining that the previously identified blind spot collision condition has ceased. In some embodiments, a previously displayed blind spot collision warning may be cleared in response to determining that the previously identified blind spot collision condition has ceased.

Although not shown separately in FIG. 35, the vehicle may identify a blind spot collision warning state concurrently with another warning state, such as another blind spot collision warning state, a blind spot warning state, a rear collision warning state, or any other warning state, may determine the most immediate warning state from the identified warning states, may operate the vehicle in accordance with the most immediate warning state, and may omit operating the vehicle in accordance with the other warning states.

FIG. 36 is a logic flow diagram of left blind spot collision avoidance in accordance with this disclosure. In some embodiments left blind spot collision avoidance may be implemented in a vehicle, such as the vehicle 1000 shown in FIG. 1 or the vehicles 2100/2110 shown in FIG. 2.

In some embodiments, left blind spot collision avoidance may include determining whether the relative position code (RPC), or the relative position code for left blind spot collision warning (RPC_(BSWL)), indicates a value of 81 (decimal representation), or 01010001 (binary representation), which may indicate that the remote vehicle is adjacent to the host vehicle, in a lane to the left of the host vehicle, level with the host vehicle, and the remote vehicle heading is converging with and aligned with the host vehicle at 36000.

In some embodiments, the relative position code (RPC), or the relative position code for left blind spot collision warning (RPC_(BSWL)), may indicate a value other than 81 (decimal representation), and blind spot collision avoidance may include determining whether the relative position code (RPC), or the relative position code for left blind spot collision warning (RPC_(BSWL)), indicates a value of 145 (decimal representation), or 10010001 (binary representation), which may indicate that the remote vehicle is behind the host vehicle, in a lane to the left of the host vehicle, level with the host vehicle, and the remote vehicle heading is converging with and aligned with the host vehicle at 36100.

In some embodiments, the relative position code (RPC), or the relative position code for left blind spot collision warning (RPC_(BSWL)), may indicate a value of 81 (decimal representation) or 145 (decimal representation) and blind spot collision avoidance may include determining whether the host vehicle dynamic state code for left blind spot collision warning (HVC_(BSWL)) indicates a value of 1, which may indicate that the host vehicle is in motion, in drive or neutral, and a turn signal for the host vehicle is active at 36200.

In some embodiments, the host vehicle dynamic state code for left blind spot collision warning (HVC_(BSWL)) may indicate a value of 1, and blind spot collision avoidance may include determining whether the remote vehicle dynamic state code for left blind spot collision warning (RVC_(BSWL)) indicates a value of 1, which may indicate that the remote vehicle is in motion and in drive at 36300.

In some embodiments, the remote vehicle dynamic state code for left blind spot collision warning (RVC_(BSWL)) may indicate a value of 1, and blind spot collision avoidance may include identifying the instantaneous distance D, the convergence angle the relative convergence angle λ, the relative longitudinal distance d_(θ), the relative lateral distance d_(φ), or a combination thereof, at 36400.

In some embodiments, blind spot collision avoidance may include determining whether the relative longitudinal distance (d_(θ)) is greater than the maximum relative longitudinal distance (d_(θmax)), the relative longitudinal distance (d_(θ)) is within the minimum relative longitudinal distance (d_(θmin)), or both at 36500.

In some embodiments, the relative longitudinal distance (d_(θ)) may be greater than the maximum relative longitudinal distance (d_(θmax)) and within the minimum relative longitudinal distance (d_(θmin)), and blind spot collision avoidance may include determining whether the maximum relative lateral distance (d_(φmax)) is greater than the relative lateral distance (d_(φ)), whether the relative lateral distance (d_(φ)) is at least the minimum relative lateral distance (d_(φmin)), or both, at 36600.

In some embodiments, the maximum relative lateral distance (d_(φmax)) may be greater than the relative lateral distance (d_(φ)) and the relative lateral distance (d_(φ)) may be at least the minimum relative lateral distance (d_(φmin)), and blind spot collision avoidance may include determining whether the host vehicle left turn signal is active (BA=01 binary notation) at 36700.

In some embodiments, the host vehicle left turn signal may be inactive, and blind spot collision avoidance may include traversing the vehicle transportation network in accordance with an advisory vehicle control action at 36800, such as the advisory vehicle control action identified at 35500, such as presenting advisory information to the driver of the host vehicle.

In some embodiments, the host vehicle left turn signal may be active, and blind spot collision avoidance may include traversing the vehicle transportation network in accordance with a warning vehicle control action at 36900, such as the advisory vehicle control action identified at 35600, such as presenting warning information to the driver of the host vehicle.

FIG. 37 is a logic flow diagram of right blind spot collision avoidance in accordance with this disclosure. In some embodiments right blind spot collision avoidance may be implemented in a vehicle, such as the vehicle 1000 shown in FIG. 1 or the vehicles 2100/2110 shown in FIG. 2.

In some embodiments, right blind spot collision avoidance may include determining whether the relative position code (RPC), or the relative position code for right blind spot collision warning (RPC_(BSWR)), indicates a value of 97 (decimal representation), or 01100001 (binary representation), which may indicate that the remote vehicle is adjacent to the host vehicle, in a lane to the right of the host vehicle, level with the host vehicle, and the remote vehicle heading is converging with and aligned with the host vehicle at 37000.

In some embodiments, the relative position code (RPC), or the relative position code for right blind spot collision warning (RPC_(BSWR)), may indicate a value other than 97 (decimal representation), and blind spot collision avoidance may include determining whether the relative position code (RPC), or the relative position code for right blind spot collision warning (RPC_(BSWR)), indicates a value of 161 (decimal representation), or 10100001 (binary representation), which may indicate that the remote vehicle is behind the host vehicle, in a lane to the right of the host vehicle, level with the host vehicle, and the remote vehicle heading is converging with and aligned with the host vehicle at 37100.

In some embodiments, the relative position code (RPC), or the relative position code for right blind spot collision warning (RPC_(BSWR)), may indicate a value of 97 (decimal representation) or 161 (decimal representation) and blind spot collision avoidance may include determining whether the host vehicle dynamic state code for right blind spot collision warning (HVC_(BSWR)) indicates a value of 1, which may indicate that the host vehicle is in motion, in drive or neutral, and a turn signal for the host vehicle is active at 37200.

In some embodiments, the host vehicle dynamic state code for right blind spot collision warning (HVC_(BSWR)) may indicate a value of 1, and blind spot collision avoidance may include determining whether the remote vehicle dynamic state code for right blind spot collision warning (RVC_(BSWR)) indicates a value of 1, which may indicate that the remote vehicle is in motion and in drive at 37300.

In some embodiments, the remote vehicle dynamic state code for right blind spot collision warning (RVC_(BSWR)) may indicate a value of 1, and blind spot collision avoidance may include identifying the instantaneous distance D, the convergence angle the relative convergence angle λ, the relative longitudinal distance d_(θ), the relative lateral distance d_(φ), or a combination thereof, at 37400.

In some embodiments, blind spot collision avoidance may include determining whether the relative longitudinal distance (d_(θ)) is greater than the maximum relative longitudinal distance (d_(θmax)), the relative longitudinal distance (d_(θ)) is within the minimum relative longitudinal distance (d_(θmin)), or both at 37500.

In some embodiments, the relative longitudinal distance (d_(φ)) may be greater than the maximum relative longitudinal distance (d_(φ)) and within the minimum relative longitudinal distance (d_(φmin)), and blind spot collision avoidance may include determining whether the maximum relative lateral distance (d_(φmax)) is greater than the relative lateral distance (d_(φ)), whether the relative lateral distance (d_(φ)) is at least the minimum relative lateral distance (d_(φmin)), or both, at 37600.

In some embodiments, the maximum relative lateral distance (d_(φmax)) may be greater than the relative lateral distance (d_(φ)) and the relative lateral distance (d_(φ)) may be at least the minimum relative lateral distance (d_(φmin)), and blind spot collision avoidance may include determining whether the host vehicle right turn signal is active (BA=10 binary notation) at 37700.

In some embodiments, the host vehicle right turn signal may be inactive, and blind spot collision avoidance may include traversing the vehicle transportation network in accordance with an advisory vehicle control action at 37800, such as the advisory vehicle control action identified at 35700, such as presenting advisory information to the driver of the host vehicle.

In some embodiments, the host vehicle right turn signal may be active, and blind spot collision avoidance may include traversing the vehicle transportation network in accordance with a warning vehicle control action at 37900, such as the advisory vehicle control action identified at 35600, such as presenting warning information to the driver of the host vehicle.

FIG. 38 is a diagram of forward collision avoidance in accordance with this disclosure. In some embodiments, forward collision avoidance may include determining that an expected path for the host vehicle and an expected path for a remote vehicle ahead of the host vehicle are convergent and that a spatial distance between the host vehicle and the remote vehicle is decreasing.

In some embodiments, forward, or front, collision avoidance may be implemented in a vehicle, such as the vehicle 1000 shown in FIG. 1 or the vehicles 2100/2110 shown in FIG. 2. Although not shown separately in FIG. 31 or FIG. 32, in some embodiments, generating convergence information, such as the generating convergence information as shown at 31300 in FIG. 31, or the generating convergence information as shown in FIG. 32, may include forward collision avoidance. In some embodiments, forward collision avoidance may include determining whether an expected path for a remote vehicle is convergent with the expected path for the host vehicle such that a difference in relative speed may result in a collision, such as the front of the host vehicle colliding with the rear of the remote vehicle.

In some embodiments, forward collision avoidance may include generating a relative position code at 38100, generating a dynamic state code at 38200, identifying an expected forward collision condition at 38300, identifying a vehicle control action at 38400, performing an advisory action at 38500, performing a warning control action at 38600, or a combination thereof.

In some embodiments, a relative position code may be generated at 38100. In some embodiments, generating a relative position code may be similar to generating convergence information as shown in FIG. 32. For example, generating a relative position code may include generating a codeword, or stabilized codeword, as shown in FIG. 32 as the relative position code.

In some embodiments, a relative position code may include one or more indicators, flags, or bits. In some embodiments, a pair of bits may represent an element of the current relative position of a remote vehicle relative to the current position of the host vehicle. Although the bits of the relative position code are described herein in a particular order, any order may be used. In some embodiments, one or more pairs of bit values, such as 11, may be unused for indicating valid information and may represent invalid or erroneous information.

For example, the relative position code may include a first bit X and a second bit W, and the bits XW may represent a relative longitudinal position of the remote vehicle, as shown in Table 53 below.

TABLE 53 X W Relative Longitudinal Position 0 0 RV ahead of HV 0 1 RV adjacent to HV 1 0 RV behind HV 1 1 Unused/Error

In another example, the relative position code may include a third bit V and a fourth bit U, and the bits VU may represent a relative lateral position of the remote vehicle, as shown in Table 54 below.

TABLE 54 V U Relative Lateral Position 0 0 RV in-line with HV 0 1 RV left of HV 1 0 RV right of HV 1 1 Unused/Error

In another example, the relative position code may include a fifth bit T and a sixth bit S, and the bits TS may represent a relative elevation of the remote vehicle, as shown in Table 55 below.

TABLE 55 T S Relative Elevation 0 0 RV level with HV 0 1 RV above HV 1 0 RV below HV 1 1 Unused/Error

In another example, the relative position code may include a seventh bit R and an eighth bit Q, and the bits RQ may represent a relative heading of the remote vehicle, as shown in Table 56 below.

TABLE 56 R Q Relative Heading 0 0 RV diverging from HV 0 1 RV converging aligned with HV 1 0 RV converging opposed with HV 1 1 RV converging perpendicular to HV

In some embodiments, the relative position code (RPC) may be an eight-bit byte, and may include the eight flags, or bits, X, W, V, U, T, S, R, Q, in a defined order, such as XWVUTSRQ, wherein the X bit is the most significant bit and the Q bit is the least significant bit.

In some embodiments, a relative position code may be indicated using binary values. For example, a remote vehicle may be ahead of the host vehicle (XW=00), in-line with the host vehicle (VU=00), level with the host vehicle (TS=00), and on a heading converging with and in alignment with the host vehicle (RQ=01), and the relative position code may be expressed as 00000001. In some embodiments, the relative position code may be expressed using the corresponding decimal notation. For example, the relative position code expressed as 00000001 in binary notation may be expressed in decimal notation as 1. In another example, a relative position code expressed as 00010000 in binary notation may be expressed in decimal notation as 16.

In some embodiments, a dynamic state code may be generated at 38200. In some embodiments, a dynamic state code may indicate a current operational state of a vehicle and may be generated based on remote vehicle information identified for the vehicle. In some embodiments, generating a dynamic state code at 38200 may include generating a remote vehicle dynamic state code (RVC), a host vehicle dynamic state code (HVC), or both.

In some embodiments, a dynamic state code may include one or more indicators, flags, or bits. In some embodiments, a pair of bits may represent an element of the current dynamic state of a remote vehicle. Although the bits of the dynamic state code are described herein in a particular order, any order may be used. In some embodiments, one or more pairs of bit values, such as 11, may be unused for indicating valid information and may represent invalid or erroneous information.

For example, the dynamic state code may include a first bit, P for the remote vehicle and H for the host vehicle, and a second bit, O for the remote vehicle and G for the host vehicle, and the bits PO/HG may represent a kinetic state of the vehicle, as shown in Table 57 below.

TABLE 57 P/H O/G Kinetic State 0 0 In Motion 0 1 Stationary 1 0 Unused/Error 1 1 Unused/Error

In another example, the dynamic state code may include a third bit, N for the remote vehicle and F for the host vehicle, and a fourth bit, M for the remote vehicle and E for the host vehicle, and the bits NM/FE may represent a lateral control state, such as a steering wheel position, of the vehicle, as shown in Table 58 below.

TABLE 58 N/F M/E Lateral Control State 0 0 Steering left 0 1 Steering Neutral 1 0 Steering Right 1 1 Unused/Error

Although not shown separately, in some embodiments, generating a dynamic state code may include generating bits, such as the N/F and M/E bits, based on a yaw rate of the vehicle instead of, or in addition to, the steering wheel position.

In another example, the dynamic state code may include a fifth bit, L for the remote vehicle and D for the host vehicle, and a sixth bit, K for the remote vehicle and C for the host vehicle, and the bits LK/DC may represent a transmission state of the vehicle, as shown in Table 59 below.

TABLE 59 L/D K/C Transmission State 0 0 Drive 0 1 Reverse 1 0 Neutral 1 1 Park

In another example, the dynamic state code may include a seventh bit, J for the remote vehicle and B for the host vehicle, and an eighth bit, I for the remote vehicle and A for the host vehicle, and the bits JI/BA may represent a signal state, such as a turn signal state, of the vehicle, as shown in Table 60 below.

TABLE 60 J/B I/A Signal State 0 0 No Signal 0 1 Left Turn Signal 1 0 Right Turn Signal 1 1 Both Signals (hazards)

In some embodiments, the dynamic state code (RVC/HVC) may be an eight-bit byte, and may include the eight flags, or bits in a defined order. For example, the remote vehicle dynamic state code (RVC) may include the eight bits P, O, N, M, L, K, J, and I, as the eight-bit byte PONMLKJI, wherein the P bit is the most significant bit and the I bit is the least significant bit. In another example, the host vehicle dynamic state code (HVC) may include the eight bits H, G, F, E, D, C, B, and A, as the eight-bit byte HGFEDCBA, wherein the H bit is the most significant bit and the A bit is the least significant bit.

In some embodiments, a dynamic state code may be indicated using binary values. For example, a remote vehicle may be in motion (PO=00), with neutral steering (NM=01), in drive (LK=00), and with no active turn signal (JI=00), and the remote vehicle dynamic state code may be expressed as 00010000, in binary notation, or as 16, in decimal notation. In another example, the host vehicle may be in motion (HG=00), with neutral steering (FE=01), in drive (DC=00), and with no active turn signal (BA=00), and the remote vehicle dynamic state code may be expressed as 00010000, in binary notation, or as 16, in decimal notation.

In some embodiments, an expected forward collision condition may be identified at 38300. In some embodiments, identifying an expected forward collision condition at 38300 may include evaluating the relative position code (RPC), the remote vehicle dynamic state code (RVC), the host vehicle dynamic state code (HVC), or a combination thereof. For example, the relative position code (RPC), the remote vehicle dynamic state code (RVC), and the host vehicle dynamic state code (HVC), may be combined as a three-byte word, and identifying an expected forward collision condition at 38300 may include evaluating the three-byte word.

In some embodiments, identifying an expected forward collision condition at 38300 may include identifying relative position code for forward collision warning (RPC_(FCW)), identifying a remote vehicle dynamic state code for forward collision warning (RVC_(FCW)), identifying a host vehicle dynamic state code for forward collision warning (HVC_(FCW)), or a combination thereof.

In some embodiments, evaluating the relative position code (RPC), the remote vehicle dynamic state code (RVC), the host vehicle dynamic state code (HVC), or a combination thereof may be expressed using Boolean Algebra notation.

In some embodiments, the relative position code for forward collision warning (RPC_(FCW)) may be identified based on the relative position code.

In some embodiments, the remote vehicle may be ahead of the host vehicle, which may be indicated by the bits X and W having the values zero (0) and zero (0) respectively, which may be expressed as XW=00, or may be expressed in Boolean Algebra notation as not X (X) and not W (W) respectively, or in combination as X W. The Boolean Algebra notation XW, which may correspond with the bit values 01, may indicate that the remote vehicle is adjacent to the host vehicle, and a non-expected forward collision condition may be identified. The Boolean Algebra notation XW, which may correspond with the bit values 10, may indicate that the remote vehicle is behind the host vehicle, and a non-expected forward collision condition may be identified. The Boolean Algebra notation XW, which may correspond with the bit values 11, may indicate a fault or error, and a non-expected forward collision condition may be identified.

In some embodiments, the remote vehicle may be in-line, or in-lane, with the host vehicle, which may be indicated by the bits V and U having the values zero (0) and zero (0) respectively, which may be expressed as VU=00, or may be expressed in Boolean Algebra notation as not V (V) and not U (Ū) respectively, or in combination as VŪ. The Boolean Algebra notation VU, which may correspond with the bit values 01, may indicate that the remote vehicle is to the left of the host vehicle, and a non-expected forward collision condition may be identified. The Boolean Algebra notation VŪ, which may correspond with the bit values 10, may indicate that the remote vehicle is to the right of the host vehicle, and a non-expected forward collision condition may be identified. The Boolean Algebra notation VU, which may correspond with the bit values 11, may indicate a fault or error, and a non-expected forward collision condition may be identified.

In some embodiments, the remote vehicle may be level with the host vehicle, which may be indicated by the bits T and S having the values zero (0) and zero (0) respectively, which may be expressed as TS=00, or may be expressed in Boolean Algebra notation as not T (T) and not S (S) respectively, or in combination as T S. The Boolean Algebra notation TS, which may correspond with the bit values 01, may indicate that the remote vehicle is above the host vehicle, and a non-expected forward collision condition may be identified. The Boolean Algebra notation TS, which may correspond with the bit values 10, may indicate that the remote vehicle is below the host vehicle, and a non-expected forward collision condition may be identified. The Boolean Algebra notation TS, which may correspond with the bit values 11, may indicate a fault or error, and a non-expected forward collision condition may be identified.

In some embodiments, the remote vehicle heading may be diverging from the host vehicle, which may be indicated by the bits R and Q having the values zero (0) and zero (0) respectively, which may be expressed as RQ=00, the remote vehicle heading may be converging with and aligned with the host vehicle, which may be indicated by the bits R and Q having the values zero (0) and one (1) respectively, which may be expressed as RQ=01, the remote vehicle heading may be converging with and opposing the host vehicle, which may be indicated by the bits R and Q having the values one (1) and zero (0) respectively, which may be expressed as RQ=10, or the remote vehicle heading may be converging with and perpendicular to the host vehicle, which may be indicated by the bits R and Q having the values one (1) and one (1) respectively, which may be expressed as RQ=11, and the relative heading of the remote vehicle (RQ) may be expressed in Boolean Algebra notation as true, or 1.

In some embodiments, determining the relative position code for forward collision warning (RPC_(FCW)) may be expressed as the following:

RPC_(FCW) =X W×VŪ×T S.   [Equation 112]

In some embodiments, the remote vehicle dynamic state code for forward collision warning (RVC_(FCW)) may be identified based on the remote vehicle dynamic state code.

In some embodiments, the remote vehicle may be in motion, which may be indicated by the bits P and O having the values zero (0) and zero (0), which may be expressed as PO=00, or may be stationary, which indicated by the bits P and O having the values zero (0) and one (1), which may be expressed as PO=01. An expected forward collision condition may be identified for a remote vehicle in motion or a stationary remote vehicle, which may be expressed in Boolean Algebra notation as not P (P). The Boolean Algebra notation PŌ or PO, which may correspond with the bit values 10 or 11, may indicate a fault or error, and a non-expected forward collision condition may be identified.

In some embodiments, the remote vehicle may be steering to the left, which may be indicated by the bits N and M having the values zero (0) and zero (0) respectively, which may be expressed as NM=00, may be steering neutral, which may be indicated by the bits N and M having the values zero (0) and one (1) respectively, which may be expressed as NM=01, or may be steering to the right, which may be indicated by the bits N and M having the values one (1) and zero (0) respectively, which may be expressed as NM=10. An expected forward collision condition may be identified for a remote vehicle in steering left, neutral, or right. The Boolean Algebra notation for not NM (NM), may correspond with the bit values 11, and may indicate a fault or error, and a non-expected forward collision condition may be identified.

In some embodiments, the remote vehicle may be in drive, which may be indicated by the bits L and K having the values zero (0) and zero (0) respectively, which may be expressed as LK=00, may be in reverse, which may be indicated by the bits L and K having the values zero (0) and one (1) respectively, which may be expressed as LK=01, may be in neutral, which may be indicated by the bits L and K having the values one (1) and zero (0) respectively, which may be expressed as LK=10, or may be in park, which may be indicated by the bits L and K having the values one (1) and one (1) respectively, which may be expressed as LK=11. An expected forward collision condition may be identified for a remote vehicle in drive, reverse, neutral, or park, which may be expressed in Boolean Algebra notation as true, or 1.

In some embodiments, the remote vehicle may not have an active external signal indicator, which may be indicated by the bits J and I having the values zero (0) and zero (0) respectively, which may be expressed as JI=00, may have an active left turn signal, which may be indicated by the bits J and I having the values zero (0) and one (1) respectively, which may be expressed as JI=01, may have an active right turn signal, which may be indicated by the bits J and I having the values one (1) and zero (0) respectively, which may be expressed as JI=10, or may have active hazards, which may be indicated by the bits J and I having the values one (1) and one (1) respectively, which may be expressed as JI=11. An expected forward collision condition may be identified for a remote vehicle that has no active external signal indicators, that has an active left turn signal indicator, that has an active right turn signal indicator, or that has active hazards, which may be expressed in Boolean Algebra notation as true, or 1.

In some embodiments, determining the remote vehicle dynamic state code for forward collision warning (RVC_(FCW)) may be expressed as the following:

RVC_(FCW) =P×NM.   [Equation 113]

In some embodiments, the host vehicle dynamic state code for forward collision warning (HVC_(FCW)) may be identified based on the host vehicle dynamic state code.

In some embodiments, the host vehicle may be in motion, which may be indicated by the bits H and G having the values zero (0) and zero (0), which may be expressed as HG=00. An expected forward collision condition may be identified for a host vehicle in motion, which may be expressed in Boolean Algebra notation as H G. The Boolean Algebra notation HG, which may correspond with the bit values 01, may indicate that the host vehicle is stationary, and a non-expected forward collision condition may be identified. The Boolean Algebra notation HG or HG, which may correspond with the bit values 10 or 11, may indicate a fault or error, and a non-expected forward collision condition may be identified.

In some embodiments, the host vehicle may be steering to the left, which may be indicated by the bits F and E having the values zero (0) and zero (0) respectively, which may be expressed as FE=00, may be steering neutral, which may be indicated by the bits F and E having the values zero (0) and one (1) respectively, which may be expressed as FE=01, or may be steering to the right, which may be indicated by the bits F and E having the values one (1) and zero (0) respectively, which may be expressed as FE=10. An expected forward collision condition may be identified for a host vehicle in steering left, neutral, or right. The Boolean Algebra notation for not FE (FE), may correspond with the bit values 11, and may indicate a fault or error, and a non-expected forward collision condition may be identified.

In some embodiments, the host vehicle may be in drive, which may be indicated by the bits D and C having the values zero (0) and zero (0) respectively, which may be expressed as DC=00, or may be in neutral, which may be indicated by the bits D and C having the values one (1) and zero (0) respectively, which may be expressed as DC=10. An expected forward collision condition may be identified for a host vehicle in drive or neutral, which may be expressed in Boolean Algebra notation as not P (P). The Boolean Algebra notation DC, which may correspond with the bit values 01, may indicate that the host vehicle is in reverse, and a non-expected forward collision condition may be identified. The Boolean Algebra notation DC, which may correspond with the bit values 11, may indicate that the host vehicle is in park, and a non-expected forward collision condition may be identified.

In some embodiments, the host vehicle may not have an active external signal indicator, which may be indicated by the bits B and A having the values zero (0) and zero (0) respectively, which may be expressed as BA=00, may have an active left turn signal, which may be indicated by the bits B and A having the values zero (0) and one (1) respectively, which may be expressed as BA=01, may have an active right turn signal, which may be indicated by the bits B and A having the values one (1) and zero (0) respectively, which may be expressed as BA=10, or may have active hazards, which may be indicated by the bits B and A having the values one (1) and one (1) respectively, which may be expressed as BA=11. An expected forward collision condition may be identified for a host vehicle that has no active external signal indicators, that has an active left turn signal indicator, that has an active right turn signal indicator, or that has active hazards, which may be expressed in Boolean Algebra notation as true, or 1.

In some embodiments, determining the host vehicle dynamic state code for forward collision warning (HVC_(FCW)) may be expressed as the following:

HVC_(FCW) =H G×FE×C.   [Equation 114]

In some embodiments, convergence information, which may include forward collision avoidance information, may be generated periodically, such as according to a defined period, such as 100 milliseconds. In some embodiments, the period between generating convergence information may be extended in response to identifying an expected forward collision condition at 38300. For example, an expected forward collision condition may be identified at 38300 and the period for generating convergence information may be extended from 100 ms to 500 ms.

In some embodiments, a vehicle control action may be identified at 38400. In some embodiments, a vehicle control action may be identified in response to identifying an expected forward collision condition at 38300. In some embodiments, a vehicle control action may indicate a vehicle control operation for safely traversing a portion the vehicle transportation network corresponding to the expected forward collision condition, such as by breaking to avoid a collision.

In some embodiments, identifying the vehicle control action at 38400 may include determining a geospatially direct line distance, or instantaneous distance, D between the host vehicle and the remote vehicle, which may be determined based on the host vehicle information, the remote vehicle information, or a combination thereof, as shown in Equation 3.

In some embodiments, identifying the vehicle control action at 38400 may include determining a deceleration rate, or breaking level, (a_(FCW)) for controlling the vehicle to traverse the vehicle transportation network by reducing the speed of the host vehicle V_(HV) so that the speed of the host vehicle V_(HV) does not exceed the speed of the remote vehicle V_(RV) prior to a defined distance threshold d_(FCW), such as three meters, exceeding the distance between the host vehicle and the remote vehicle, which may be expressed as the following:

$\begin{matrix} {a_{FCW} = {\frac{- \left( {v_{HV} - v_{RV}} \right)^{2}}{2\left( {D - d_{FCW}} \right)}.}} & \left\lbrack {{Equation}\mspace{14mu} 115} \right\rbrack \end{matrix}$

In some embodiments, an advisory vehicle control action may be performed at 38500. In some embodiments, the deceleration rate (a_(FCW)) may be within a forward collision advisory deceleration rate threshold, such as −0.15 times the acceleration rate of gravity (g), which may be expressed as a_(FCW)≦0.15 g, and an advisory vehicle control action corresponding to the deceleration rate may be identified as the vehicle control action. For example, the advisory vehicle control action may include presenting information indicating the expected forward collision, the vehicle control action for safely traversing the vehicle transportation network to avoid the expected forward collision, such as breaking, or a combination thereof, to the driver of the host vehicle.

In some embodiments, a warning vehicle control action may be performed at 38500. In some embodiments, the deceleration rate (a_(FCW)) may be within a forward collision warning deceleration rate threshold, such as −0.25 g, which may be expressed as a_(FCW)≦−0.25 g, and a warning vehicle control action corresponding to the deceleration rate may be identified as the vehicle control action. For example, the warning vehicle control action may include presenting information indicating the expected forward collision and the vehicle control action for safely traversing the vehicle transportation network to avoid the expected forward collision, such as breaking, or a combination thereof, to the driver of the host vehicle, and autonomously controlling the vehicle in accordance with the warning vehicle control action, such as by breaking at the identified deceleration rate (a_(FCW)).

Although not shown separately in FIG. 38, in some embodiments, forward collision avoidance may include determining that a previously identified expected forward collision condition has ceased. For example, an expected forward collision condition may be identified, the host vehicle may traverse the vehicle transportation network safely in accordance with the advisory action at 38500 or the warning action at 38600, the speed of the host vehicle relative to the remote vehicle may be zero, and forward collision avoidance may include determining that the previously identified expected forward collision condition has ceased. In some embodiments, a previously displayed forward collision warning may be cleared in response to determining that the previously identified expected forward collision condition has ceased.

Although not shown separately in FIG. 38, the vehicle may identify a forward collision warning state concurrently with another warning state, such as another forward collision warning state, a blind spot warning state, a rear collision warning state, or any other warning state, may determine the most immediate warning state from the identified warning states, may operate the vehicle in accordance with the most immediate warning state, and may omit operating the vehicle in accordance with the other warning states.

FIG. 39 is a logic flow diagram of the example of forward collision avoidance shown in FIG. 38, in accordance with this disclosure. In some embodiments, forward, or front, collision avoidance may be implemented in a vehicle, such as the vehicle 1000 shown in FIG. 1 or the vehicles 2100/2110 shown in FIG. 2.

In some embodiments, forward collision avoidance may include determining whether the relative longitudinal position portion (XW) of a relative position code (RPC), such as the relative position code identified at 38100 as shown in FIG. 38, includes a fault code (11; binary representation) at 39000.

In some embodiments, the relative longitudinal position portion (XW) of the relative position code (RPC) may include a non-fault code (00, 01, 10; binary representation) and forward collision avoidance may include determining whether the relative lateral position portion (VU) of the relative position code (RPC) includes a fault code (11; binary representation) at 39010.

In some embodiments, the relative lateral position portion (VU) of the relative position code (RPC) may include a non-fault code (00, 01, 10; binary representation) and forward collision avoidance may include determining whether the relative elevation position portion (TS) of the relative position code (RPC) includes a fault code (11; binary representation) at 39020.

In some embodiments, the relative elevation portion (VU) of the relative position code (RPC) may include a non-fault code (00, 01, 10; binary representation) and forward collision avoidance may include determining whether the first bit of the host vehicle motion portion (H) of a host vehicle dynamic state code (HVC), such as the host vehicle dynamic state code identified at 38200 as shown in FIG. 38, and the host vehicle lateral control portion (FE) of the host vehicle dynamic state code (HVC) includes a fault code (111; binary representation) at 39030.

In some embodiments, the first bit of the host vehicle motion portion (H) of the host vehicle dynamic state code (HVC) and the host vehicle lateral control portion (FE) of the host vehicle dynamic state code (HVC) may include a non-fault code (00, 01, 10; binary representation) and forward collision avoidance may include determining whether the first bit of the remote vehicle motion portion (P) of a remote vehicle dynamic state code (RVC), such as the remote vehicle dynamic state code identified at 38200 as shown in FIG. 38, and the remote vehicle lateral control portion (NM) of the remote vehicle dynamic state code (RVC) includes a fault code (111; binary representation) at 39040.

In some embodiments, the first bit of the remote vehicle motion portion (P) of the remote vehicle dynamic state code (RVC) and the remote vehicle lateral control portion (NM) of the remote vehicle dynamic state code (RVC) may include a non-fault code (000, 001, 010, 011, 100, 101, 110; binary representation) and forward collision avoidance may include determining whether the relative position code (RPC) indicates an expected forward collision condition (RPC=1; decimal representation) at 39200.

In some embodiments, the relative position code (RPC) may indicate an expected forward collision condition and forward collision avoidance may include determining whether a host vehicle dynamic state code for forward collision warning (HVC_(FCW)), such as the host vehicle dynamic state code for forward collision warning identified at 38300 as shown in FIG. 38, indicates an expected forward collision condition (HVC_(FCW)=1) at 39300.

In some embodiments, host vehicle dynamic state code for forward collision warning (HVC_(FCW)) may indicate an expected forward collision condition and forward collision avoidance may include determining whether a remote vehicle dynamic state code for forward collision warning (RVC_(FCW)), such as the remote vehicle dynamic state code for forward collision warning identified at 38300 as shown in FIG. 38, indicates an expected forward collision condition (RVC_(FCW)=1) at 39400.

In some embodiments, remote vehicle dynamic state code for forward collision warning (RVC_(FCW)) may indicate an expected forward collision condition, forward collision avoidance may include determining a deceleration rate (a_(FCW)) at 39500, such as the deceleration rate identified at 38400 as shown in FIG. 38, and forward collision avoidance may include determining whether a forward collision warning deceleration rate threshold (a_(WT)), such as −0.25 g, exceeds the deceleration rate (a_(FCW)≦a_(WT), a_(WT)=−0.25 g) at 39600.

In some embodiments, the deceleration rate may be at least the forward collision warning deceleration rate threshold and forward collision avoidance may include traversing the vehicle transportation network in accordance with a warning vehicle control action at 39700, such as the warning vehicle control action identified at 38500, such as breaking in accordance with the deceleration rate.

In some embodiments, the forward collision warning deceleration rate threshold may exceed the deceleration rate and forward collision avoidance may include determining whether a forward collision advisory deceleration rate threshold (a_(AT)), such as −0.15 g, exceeds the deceleration rate (a_(FCW)≦a_(AT), a_(AT)=−0.15 g) at 39800.

In some embodiments, the deceleration rate may be at least the forward collision advisory deceleration rate threshold and forward collision avoidance may include traversing the vehicle transportation network in accordance with an advisory vehicle control action at 39900, such as the advisory vehicle control action identified at 38500, such as breaking in accordance with the deceleration rate.

FIG. 40 is a diagram of rear-end collision avoidance in accordance with this disclosure. In some embodiments, rear-end collision avoidance may include determining that an expected path for the host vehicle and an expected path for a remote vehicle behind the host vehicle are convergent and that a spatial distance between the host vehicle and the remote vehicle is decreasing.

In some embodiments, rear-end collision avoidance may be implemented in a vehicle, such as the vehicle 1000 shown in FIG. 1 or the vehicles 2100/2110 shown in FIG. 2. Although not shown separately in FIG. 31 or FIG. 32, in some embodiments, generating convergence information, such as the generating convergence information as shown at 31300 in FIG. 31, or the generating convergence information as shown in FIG. 32, may include rear-end collision avoidance.

In some embodiments, rear-end collision avoidance may include generating a relative position code at 40100, generating a dynamic state code at 40200, identifying an expected rear-end collision condition at 40300, identifying a vehicle control action at 40400, performing an advisory action at 40500, performing a warning control action at 40600, or a combination thereof.

In some embodiments, a relative position code may be generated at 40100. In some embodiments, generating a relative position code may be similar to generating convergence information as shown in FIG. 32. For example, generating a relative position code may include generating a codeword, or stabilized codeword, as shown in FIG. 32 as the relative position code.

In some embodiments, a relative position code may include one or more indicators, flags, or bits. In some embodiments, a pair of bits may represent an element of the current relative position of a remote vehicle relative to the current position of the host vehicle. Although the bits of the relative position code are described herein in a particular order, any order may be used. In some embodiments, one or more pairs of bit values, such as 11, may be unused for indicating valid information and may represent invalid or erroneous information.

For example, the relative position code may include a first bit X and a second bit W, and the bits XW may represent a relative longitudinal position of the remote vehicle, as shown in Table 61 below.

TABLE 61 X W Relative Longitudinal Position 0 0 RV ahead of HV 0 1 RV adjacent to HV 1 0 RV behind HV 1 1 Unused/Error

In another example, the relative position code may include a third bit V and a fourth bit U, and the bits VU may represent a relative lateral position of the remote vehicle, as shown in Table 62 below.

TABLE 62 V U Relative Lateral Position 0 0 RV in-line with HV 0 1 RV left of HV 1 0 RV right of HV 1 1 Unused/Error

In another example, the relative position code may include a fifth bit T and a sixth bit S, and the bits TS may represent a relative elevation of the remote vehicle, as shown in Table 63 below.

TABLE 63 T S Relative Elevation 0 0 RV level with HV 0 1 RV above HV 1 0 RV below HV 1 1 Unused/Error

In another example, the relative position code may include a seventh bit R and an eighth bit Q, and the bits RQ may represent a relative heading of the remote vehicle, as shown in Table 64 below.

TABLE 64 R Q Relative Heading 0 0 RV diverging from HV 0 1 RV converging aligned with HV 1 0 RV converging opposed with HV 1 1 RV converging perpendicular to HV

In some embodiments, the relative position code (RPC) may be an eight-bit byte, and may include the eight flags, or bits, X, W, V, U, T, S, R, Q, in a defined order, such as XWVUTSRQ, wherein the X bit is the most significant bit and the Q bit is the least significant bit.

In some embodiments, a relative position code may be indicated using binary values. For example, a remote vehicle may be behind the host vehicle (XW=10), in-lane with the left of the host vehicle (VU=00), level with the host vehicle (TS=00), and on a heading converging with and in alignment with the host vehicle (RQ=01), and the relative position code may be expressed as 10000001. In some embodiments, the relative position code may be expressed using the corresponding decimal notation. For example, the relative position code expressed as 10000001 in binary notation may be expressed in decimal notation as 129.

In some embodiments, a dynamic state code may be generated at 40200. In some embodiments, a dynamic state code may indicate a current operational state of a vehicle and may be generated based on remote vehicle information identified for the vehicle. In some embodiments, generating a dynamic state code at 40200 may include generating a remote vehicle dynamic state code (RVC), a host vehicle dynamic state code (HVC), or both.

In some embodiments, a dynamic state code may include one or more indicators, flags, or bits. In some embodiments, a pair of bits may represent an element of the current dynamic state of a remote vehicle. Although the bits of the dynamic state code are described herein in a particular order, any order may be used. In some embodiments, one or more pairs of bit values, such as 11, may be unused for indicating valid information and may represent invalid or erroneous information.

For example, the dynamic state code may include a first bit, P for the remote vehicle and H for the host vehicle, and a second bit, O for the remote vehicle and G for the host vehicle, and the bits PO/HG may represent a kinetic state of the vehicle, as shown in Table 65 below.

TABLE 65 P/H O/G Kinetic State 0 0 In Motion 0 1 Stationary 1 0 Unused/Error 1 1 Unused/Error

In another example, the dynamic state code may include a third bit, N for the remote vehicle and F for the host vehicle, and a fourth bit, M for the remote vehicle and E for the host vehicle, and the bits NM/FE may represent a lateral control state, such as a steering wheel position, of the vehicle, as shown in Table 66 below.

TABLE 66 N/F M/E Lateral Control State 0 0 Steering left 0 1 Steering Neutral 1 0 Steering Right 1 1 Unused/Error

Although not shown separately, in some embodiments, generating a dynamic state code may include generating bits, such as the N/F and M/E bits, based on a yaw rate of the vehicle instead of, or in addition to, the steering wheel position.

In another example, the dynamic state code may include a fifth bit, L for the remote vehicle and D for the host vehicle, and a sixth bit, K for the remote vehicle and C for the host vehicle, and the bits LK/DC may represent a transmission state of the vehicle, as shown in Table 67 below.

TABLE 67 L/D K/C Transmission State 0 0 Drive 0 1 Reverse 1 0 Neutral 1 1 Park

In another example, the dynamic state code may include a seventh bit, J for the remote vehicle and B for the host vehicle, and an eighth bit, I for the remote vehicle and A for the host vehicle, and the bits JI/BA may represent a signal state, such as a turn signal state, of the vehicle, as shown in Table 68 below.

TABLE 68 J/B I/A Signal State 0 0 No Signal 0 1 Left Turn Signal 1 0 Right Turn Signal 1 1 Both Signals (hazards)

In some embodiments, the dynamic state code (RVC/HVC) may be an eight-bit byte, and may include the eight flags, or bits in a defined order. For example, the remote vehicle dynamic state code (RVC) may include the eight bits P, O, N, M, L, K, J, and I, as the eight-bit byte PONMLKJI, wherein the P bit is the most significant bit and the I bit is the least significant bit. In another example, the host vehicle dynamic state code (HVC) may include the eight bits H, G, F, E, D, C, B, and A, as the eight-bit byte HGFEDCBA, wherein the H bit is the most significant bit and the A bit is the least significant bit.

In some embodiments, a dynamic state code may be indicated using binary values. For example, a remote vehicle may be in motion (PO=00), with neutral steering (NM=01), in drive (LK=00), and with no active turn signal (JI=00), and the remote vehicle dynamic state code may be expressed as 00010000, in binary notation, or as 16, in decimal notation. In another example, the host vehicle may be in motion (HG=00), with neutral steering (FE=01), in drive (DC=00), and with no active turn signal (BA=00), and the remote vehicle dynamic state code may be expressed as 00010000, in binary notation, or as 16, in decimal notation.

In some embodiments, an expected rear-end collision condition may be identified at 40300. For example, the remote vehicle may be traversing the vehicle transportation network along a path similar to the host vehicle, behind the host vehicle, and in-lane with the host vehicle, and an expected rear-end collision condition may indicate an expected rear-end collision between the host vehicle and the remote vehicle responsive to a deceleration by the host vehicle, an acceleration by the remote vehicle, or both.

In some embodiments, identifying an expected rear-end collision condition at 40300 may include evaluating the relative position code (RPC), the remote vehicle dynamic state code (RVC), the host vehicle dynamic state code (HVC), or a combination thereof. For example, the relative position code (RPC), the remote vehicle dynamic state code (RVC), and the host vehicle dynamic state code (HVC), may be combined as a three-byte word, and identifying an expected rear-end collision condition at 40300 may include evaluating the three-byte word.

In some embodiments, identifying an expected rear-end collision condition at 40300 may include identifying relative position code for rear-end collision avoidance warning (RPC_(RCAW)), identifying a remote vehicle dynamic state code for rear-end collision avoidance warning (RVC_(RCAW)), identifying a host vehicle dynamic state code for rear-end collision avoidance warning (HVC_(RCAW)), or a combination thereof. In some embodiments, evaluating the relative position code (RPC), the remote vehicle dynamic state code (RVC), the host vehicle dynamic state code (HVC), or a combination thereof may be expressed using Boolean Algebra notation.

In some embodiments, the relative position code for rear-end collision avoidance warning (RPC_(RCAW)) may be identified based on the relative position code.

In some embodiments, the remote vehicle may be behind the host vehicle, which may be indicated by the bits X and W having the values one (1) and zero (0) respectively, which may be expressed as XW=10, or may be expressed in Boolean Algebra notation as X (X) and not W (W) respectively, or in combination as XW, and an expected rear-end collision condition may be identified. The Boolean Algebra notation X W, which may correspond with the bit values 00, may indicate that the remote vehicle is ahead of the host vehicle, and a non-rear-end collision condition may be identified. The Boolean Algebra notation XW, which may correspond with the bit values 01, may indicate that the remote vehicle is adjacent to the host vehicle, and a non-rear-end collision condition may be identified. The Boolean Algebra notation XW, which may correspond with the bit values 11, may indicate a fault or error, and a non-rear-end collision condition may be identified.

In some embodiments, the remote vehicle may in-line with the host vehicle, which may be indicated by the bits V and U having the values zero (0) and zero (0) respectively, which may be expressed as VU=00, or may be expressed in Boolean Algebra notation as not V (V) and not U (Ū) respectively, or in combination as VŪ, and an expected rear-end collision condition may be identified. The Boolean Algebra notation VU, which may correspond with the bit values 01, may indicate that the remote vehicle is to the left of the host vehicle, and a non-rear-end collision condition may be identified. The Boolean Algebra notation VŪ, which may correspond with the bit values 10, may indicate that the remote vehicle is to the right of the host vehicle, and a non-rear-end collision condition may be identified. The Boolean Algebra notation VU, which may correspond with the bit values 11, may indicate a fault or error, and a non-rear-end collision condition may be identified.

In some embodiments, the remote vehicle may be level with the host vehicle, which may be indicated by the bits T and S having the values zero (0) and zero (0) respectively, which may be expressed as TS=00, or may be expressed in Boolean Algebra notation as not T (T) and not S (S) respectively, or in combination as T S. The Boolean Algebra notation TS, which may correspond with the bit values 01, may indicate that the remote vehicle is above the host vehicle, and a non-rear-end collision condition may be identified. The Boolean Algebra notation TS, which may correspond with the bit values 10, may indicate that the remote vehicle is below the host vehicle, and a non-rear-end collision condition may be identified. The Boolean Algebra notation TS, which may correspond with the bit values 11, may indicate a fault or error, and a non-rear-end collision condition may be identified.

In some embodiments, the remote vehicle heading may be converging with and aligned with the host vehicle heading, which may be indicated by the bits R and Q having the values zero (0) and one (1) respectively, which may be expressed as RQ=01, and the relative heading of the remote vehicle (RQ) may be expressed in Boolean Algebra notation as RQ, and an expected rear-end collision condition may be identified. The Boolean Algebra notation R Q, which may correspond with the bit values RQ=00, may indicate that the remote vehicle heading may be diverging from the host vehicle, and a non-rear-end collision condition may be identified. The Boolean Algebra notation RQ, which may correspond with the bit values RQ=10, may indicate that the remote vehicle heading may be converging with and opposing the host vehicle, and a non-rear-end collision condition may be identified. The Boolean Algebra notation RQ, which may correspond with the bit values RQ=11, may indicate that the remote vehicle heading may be converging with and perpendicular to the host vehicle, and a non-rear-end collision condition may be identified.

In some embodiments, determining the relative position code for rear-end collision avoidance warning (RPC_(RCAW)) may be expressed as the following:

RPC_(RCAW) =XW×VŪ×T S×RQ.   [Equation 116]

In some embodiments, the remote vehicle dynamic state code for rear-end collision avoidance warning (RVC_(RCAW)) may be identified based on the remote vehicle dynamic state code.

In some embodiments, the remote vehicle may be in motion, which may be indicated by the bits P and O having the values zero (0) and zero (0), which may be expressed as PO=00, and an expected rear-end collision condition may be identified for a remote vehicle in motion, which may be expressed in Boolean Algebra notation as not P (P) and not O (Ō), or in combination as PŌ. The Boolean Algebra notation PO, which may correspond with the bit values 01, may indicate that the remote vehicle is stationary, and a non-rear-end collision condition may be identified. The Boolean Algebra notation PŌ or PO, which may correspond with the bit values 10 or 11, may indicate a fault or error, and a non-rear-end collision condition may be identified.

In some embodiments, the remote vehicle may be steering to the left, which may be indicated by the bits N and M having the values zero (0) and zero (0) respectively, which may be expressed as NM=00, may be steering neutral, which may be indicated by the bits N and M having the values zero (0) and one (1) respectively, which may be expressed as NM=01, or may be steering to the right, which may be indicated by the bits N and M having the values one (1) and zero (0) respectively, which may be expressed as NM=10. An expected rear-end collision condition may be identified for a remote vehicle in steering left, neutral, or right. The Boolean Algebra notation for not NM (NM), may correspond with the bit values 11, and may indicate a fault or error, and a non-rear-end collision condition may be identified.

In some embodiments, the remote vehicle may be in drive, which may be indicated by the bits L and K having the values zero (0) and zero (0) respectively, which may be expressed as LK=00, or the remote vehicle may be in neutral, which may be indicated by the bits L and K having the values zero (0) and one (1) respectively, which may be expressed as LK=01, and an expected rear-end collision condition may be identified for a remote vehicle in drive or neutral, which may be expressed in Boolean Algebra notation as not K (K). The Boolean Algebra notation LK, which may correspond with the bit values 01, may indicate that the remote vehicle is in reverse, and a non-rear-end collision condition may be identified. The Boolean Algebra notation LK, which may correspond with the bit values 11, may indicate that the remote vehicle is in park, and a non-rear-end collision condition may be identified.

In some embodiments, the remote vehicle may not have an active external signal indicator, which may be indicated by the bits J and I having the values zero (0) and zero (0) respectively, which may be expressed as JI=00, may have an active left turn signal, which may be indicated by the bits J and I having the values zero (0) and one (1) respectively, which may be expressed as JI=01, may have an active right turn signal, which may be indicated by the bits J and I having the values one (1) and zero (0) respectively, which may be expressed as JI=10, or may have active hazards, which may be indicated by the bits J and I having the values one (1) and one (1) respectively, which may be expressed as JI=11. An expected rear-end collision condition may be identified for a remote vehicle that has no active external signal indicators, that has an active left turn signal indicator, that has an active right turn signal indicator, or that has active hazards, which may be expressed in Boolean Algebra notation as true, or 1.

In some embodiments, determining the remote vehicle dynamic state code for rear-end collision avoidance warning (RVC_(RCAW)) may be expressed as the following:

RVC_(RCAW) =PŌ×NM×K.   [Equation 117]

In some embodiments, the host vehicle dynamic state code for rear-end collision avoidance warning (HVC_(RCAW)) may be identified based on the host vehicle dynamic state code.

In some embodiments, the host vehicle may be in motion, which may be indicated by the bits H and G having the values zero (0) and zero (0), which may be expressed as HG=00, or the host vehicle may be stationary, which may be indicated by the bits H and G having the values zero (0) and one (1), which may be expressed as HG=01, and an expected rear-end collision condition may be identified for a host vehicle in motion or stationary, which may be expressed in Boolean Algebra notation as not H (H). The Boolean Algebra notation HG or HG, which may correspond with the bit values 10 or 11, may indicate a fault or error, and a non-rear-end collision condition may be identified.

In some embodiments, the host vehicle may be steering to the left, which may be indicated by the bits F and E having the values zero (0) and zero (0) respectively, which may be expressed as FE=00, may be steering neutral, which may be indicated by the bits F and E having the values zero (0) and one (1) respectively, which may be expressed as FE=01, or may be steering to the right, which may be indicated by the bits F and E having the values one (1) and zero (0) respectively, which may be expressed as FE=10. An expected rear-end collision condition may be identified for a host vehicle steering left, neutral, or right. The Boolean Algebra notation for not FE (FE), may correspond with the bit values 11, and may indicate a fault or error, and a non-rear-end collision condition may be identified.

In some embodiments, the host vehicle may be in drive, which may be indicated by the bits D and C having the values zero (0) and zero (0) respectively, which may be expressed as DC=00, the host vehicle may be in reverse, which may be indicated by the bits D and C having the values zero (0) and one (1) respectively, which may be expressed as DC=01, the host vehicle may be in neutral, which may be indicated by the bits D and C having the values one (1) and zero (0) respectively, which may be expressed as DC=10, the host vehicle may be in park, which may be indicated by the bits D and C having the values one (1) and one (1) respectively, which may be expressed as DC=11, and an expected rear-end collision condition may be identified for a host vehicle in neutral, reverse, park, or drive, which may be expressed in Boolean Algebra notation as true, or 1.

In some embodiments, the host vehicle may not have an active external signal indicator, which may be indicated by the bits B and A having the values zero (0) and zero (0) respectively, which may be expressed as BA=00, may have an active left turn signal, which may be indicated by the bits B and A having the values zero (0) and one (1) respectively, which may be expressed as BA=01, may have an active right turn signal, which may be indicated by the bits B and A having the values one (1) and zero (0) respectively, which may be expressed as BA=10, or may have active hazards, which may be indicated by the bits B and A having the values one (1) and one (1) respectively, which may be expressed as BA=11. An expected rear-end collision condition may be identified for a host vehicle that has no active external signal indicators, that has an active left turn signal indicator, that has an active right turn signal indicator, or that has active hazards, which may be expressed in Boolean Algebra notation as true, or 1.

In some embodiments, determining the host vehicle dynamic state code for rear-end collision avoidance warning (HVC_(RCAW)) may be expressed as the following:

HVC_(RCAW) =H×FE.   [Equation 118]

In some embodiments, convergence information, which may include rear-end collision avoidance information, may be generated periodically, such as according to a defined period, such as 100 milliseconds. In some embodiments, the period between generating convergence information may be extended in response to identifying an expected rear-end collision condition at 40300. For example, an expected rear-end collision condition may be identified at 40300 and the period for generating convergence information may be extended from 100 ms to 500 ms.

In some embodiments, a vehicle control action may be identified at 40400. In some embodiments, a vehicle control action may be identified in response to identifying an expected rear-end collision condition at 40300. In some embodiments, a vehicle control action may indicate a vehicle control operation for safely traversing a portion the vehicle transportation network corresponding to the expected rear-end collision condition, such as by oscillating, blinking, or flashing, break lamps, the vehicle control action may indicate a vehicle control operation for minimizing an effect of an expected rear-end collision, such as by presenting information to the driver indicating the expected rear-end collision, adjusting safety belt tension, adjusting a head rest position, or a combination thereof, or the vehicle control action may indicate a combination of vehicle control operations for safely traversing a portion the vehicle transportation network corresponding to the expected rear-end collision condition and minimizing an effect of an expected rear-end collision.

In some embodiments, identifying the vehicle control action at 40400 may include determining a geospatially direct line distance, or instantaneous distance D, between the host vehicle and the remote vehicle, which may be determined based on the host vehicle information, the remote vehicle information, or a combination thereof, as shown in Equation 3.

In some embodiments, identifying the vehicle control action at 40400 may include determining a deceleration rate (a_(RCAW)) for the remote vehicle to traverse the vehicle transportation network by decreasing the speed of the remote vehicle V_(RV) so that the speed of the remote vehicle V_(RV) does not exceed the speed of the host vehicle V_(HV) prior to a defined distance threshold d_(RCAW), such as three meters, which may be expressed as the following:

$\begin{matrix} {a_{RCAW} = {\frac{- \left( {v_{RV} - v_{HV}} \right)^{2}}{2\left( {D - d_{RCAW}} \right)}.}} & \left\lbrack {{Equation}\mspace{14mu} 119} \right\rbrack \end{matrix}$

In some embodiments, an advisory vehicle control action may be performed at 40500. In some embodiments, the deceleration rate (a_(RCAW)) may be within a rear-end collision advisory deceleration rate threshold, such as −0.15 times the acceleration rate of gravity (g), which may be expressed as a_(RCAW)≦−0.15 g, and an advisory vehicle control action corresponding to the deceleration rate may be identified as the vehicle control action. For example, the advisory vehicle control action may include oscillating, blinking, or flashing, the host vehicle break lamps at an advisory frequency, such as 2 Hz. In some embodiments, the advisory vehicle control action may include presenting information indicating an expected rear-end collision to the driver of the host vehicle.

In some embodiments, a warning vehicle control action may be performed at 40500. In some embodiments, the deceleration rate (a_(RCAW)) may be within a rear-end collision warning deceleration rate threshold, such as −0.25 g, which may be expressed as a_(RCAW)≦−0.25 g, and a warning vehicle control action corresponding to the deceleration rate may be identified as the vehicle control action. For example, the warning vehicle control action may include oscillating, blinking, or flashing, the host vehicle break lamps at a warning frequency, such as 4 Hz. In some embodiments, the warning vehicle control action may include adjusting safety belt tension of a safety belt of the host vehicle, adjusting one or more head rest positions of the host vehicle, presenting information indicating the expected rear-end collision to the driver of the host vehicle, or a combination thereof.

Although not shown separately in FIG. 40, in some embodiments, rear-end collision avoidance may include determining that a previously identified rear-end collision condition has ceased. For example, an expected rear-end collision condition may be identified, the host vehicle may traverse the vehicle transportation network safely in accordance with the advisory action at 40500 or the warning action at 40600, the speed of the host vehicle relative to the remote vehicle may be zero, and rear-end collision avoidance may include determining that the previously identified rear-end collision condition has ceased. In some embodiments, a previously displayed rear-end collision warning may be cleared in response to determining that the previously identified rear-end collision condition has ceased.

Although not shown separately in FIG. 40, the vehicle may identify a rear-end collision warning state concurrently with another warning state, such as another rear-end collision warning state, a blind spot warning state, a forward collision warning state, or any other warning state, may determine the most immediate warning state from the identified warning states, may operate the vehicle in accordance with the most immediate warning state, and may omit operating the vehicle in accordance with the other warning states.

FIG. 41 is a logic flow diagram of the example of rear-end collision avoidance shown in FIG. 40, in accordance with this disclosure. In some embodiments rear-end collision avoidance may be implemented in a vehicle, such as the vehicle 1000 shown in FIG. 1 or the vehicles 2100/2110 shown in FIG. 2.

In some embodiments, rear-end collision avoidance may include determining whether the relative position code (RPC) indicates a value of 129 (decimal representation), or 10000001 (binary representation), which may indicate that the remote vehicle is behind the host vehicle, in-line with the host vehicle, level with the host vehicle, and the remote vehicle heading is converging with and aligned with the host vehicle at 41000.

In some embodiments, the relative position code (RPC) may indicate a value of 129 (decimal representation) and rear-end collision avoidance may include determining whether the host vehicle dynamic state code for rear-end collision avoidance warning (HVC_(RCAW)) indicates a value of 1, which may indicate that the host vehicle is in motion or stationary, and in drive, park, reverse, or neutral, at 41100.

In some embodiments, the host vehicle dynamic state code for rear-end collision avoidance warning (HVC_(RCAW)) may indicate a value of 1, and rear-end collision avoidance may include determining whether the remote vehicle dynamic state code for rear-end collision avoidance warning (RVC_(RCAW)) indicates a value of 1, which may indicate that the remote vehicle is in motion and in drive or neutral at 41200.

In some embodiments, the remote vehicle dynamic state code for rear-end collision avoidance warning (RVC_(RCAW)) may indicate a value of 1, and rear-end collision avoidance may include identifying the instantaneous distance D, the deceleration rate (a_(RCAW)), or both, at 41300, such as the deceleration rate identified at 40400 as shown in FIG. 40, and rear-end collision avoidance may include determining whether a rear-end collision warning deceleration rate threshold (a_(WT)), such as −0.25 g, exceeds the deceleration rate (a_(RCAW)≦a_(WT), a_(WT)=−0.25 g) at 41500.

In some embodiments, the deceleration rate may be at least the rear-end collision warning deceleration rate threshold and rear-end collision avoidance may include traversing the vehicle transportation network in accordance with a warning vehicle control action at 41600, such as the warning vehicle control action identified at 40500, such as such as by oscillating, blinking, or flashing, break lamps at a warning frequency, such as 4 Hz, presenting information to the driver indicating the expected rear-end collision, adjusting safety belt tension, adjusting a head rest position, or a combination thereof.

In some embodiments, the rear-end collision warning deceleration rate threshold may exceed the deceleration rate and rear-end collision avoidance may include determining whether a rear-end collision advisory deceleration rate threshold (a_(AT)), such as −0.15 g, exceeds the deceleration rate (a_(RCAW)≦a_(AT), a_(AT)=−0.15 g) at 41700.

In some embodiments, the deceleration rate may be at least the rear-end collision advisory deceleration rate threshold and rear-end collision avoidance may include traversing the vehicle transportation network in accordance with an advisory vehicle control action at 41800, such as the advisory vehicle control action identified at 40500, such as such as by oscillating, blinking, or flashing, break lamps at an advisory frequency, such as 2 Hz, presenting information to the driver indicating the expected rear-end collision, or a combination thereof.

The above-described aspects, examples, and implementations have been described in order to allow easy understanding of the disclosure are not limiting. On the contrary, the disclosure covers various modifications and equivalent arrangements included within the scope of the appended claims, which scope is to be accorded the broadest interpretation so as to encompass all such modifications and equivalent structure as is permitted under the law. 

What is claimed is:
 1. A vehicle comprising: a processor configured to execute instructions stored on a non-transitory computer readable medium to: traverse a vehicle transportation network by: receiving, from a remote vehicle, via a wireless electronic communication link, a remote vehicle message, the remote vehicle message including remote vehicle information; determining a relative position code indicating geospatial location of the remote vehicle relative to the host vehicle based the remote vehicle information; determining a remote vehicle dynamic state code based on the remote vehicle information; determining a host vehicle dynamic state code; identifying a vehicle control action based on the relative position code, the remote vehicle dynamic state code, and the host vehicle dynamic state code; and traversing a portion of the vehicle transportation network in accordance with the vehicle control action, such that traversing the portion of the vehicle transportation network includes performing passing lane collision avoidance. 